Dijkstra's Algorithm -- from Wolfram MathWorld

An algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path tree from the initial vertex to every other vertex in the graph. The algorithm is implemented as Dijkstr

mathworld.wolfram.com