Example 1: Dijkstra's Algorithm for Shortest Route 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 the example press the start button.  If you would like to step through
the example, press Pause then the Step button.

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

 Previous Example

Return to Index