networks1

 Dijkstra's Algorithm for Shortest Route Problems

The arcs are labeled with their lengths in the network below.  The example steps though Dijkstra's Algorithm to find the shortest route from the origin O to the destination T.