Example Networks1: Dijkstra's Algorithm for Shortest Route Problems

Below is a network with the arcs labeled with their lengths.  The example will step though Dijkstra's Algorithm to find the shortest route from the origin O to the destination T.

Press the Start button twice to begin the example.