Dijkstra's Algorithm

This page list information about Dijkstra's Algorithm

Algorithm Steps

Set the distance to the source vertex as 0, and to all other vertices as infinity.
Select the unvisited vertex with the smallest known distance.
For each neighbor of that vertex, update its distance if a shorter path is found through the current vertex.
Mark the current vertex as visited (its shortest distance is now final).
Continue until all vertices have been visited or no shorter paths remain.