Below is a netork with the arcs labeled with distance.
The example will step though Dijkstra's Algorithm to find the shortest route from
the origin O and the destination T.
To begin press the Start button. If you would like to step through the animation,
press Pause, then use Step.