2
Dijkstra shortest path algorithm is used to find the shortest distance from a given vertex to other vertices in graph. Dijsktra algorithm is explained with example.
