Example 1: 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 to begin the example.

This animation was made using Alligator Flash Designer 7.  More information about this program is available at Selteco Alligator.
You can view the source code for this animation using the trial verson of Alligator Flash Designer 7 and this file.