Dijkstra's Algorithm for Shortest Path Problems

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.

This animation was created using Jawaa 2.0. For source code, visit www.cs.duke.edu/csed/jawaa2
For the source code for this animation, click here