Dijkstra’s algorithm used to solve shortest path problem.. Its used in routing…

For given source vertex(node) in the graph ,the alg will find the shortest path between the vertex and with every other vertex.

Ex: Finding shortest route between one city and all other cities..

(more…)