New Dijkstra's Algorithm Demonstration
Instructions for running the animation
- Choose a data set from the list or
Input files
You may add to the standard list of input files.
Prepare a file containing n integers - one to a line.
Insert an initial line containing n, eg
4
1
3
5
6
Save this file with the name rbn, where n
is 1 greater than the last file in the series in the applet's directory.
The program looks for files dij0, dij1, etc and
stops as soon as there is a gap in the series.
End of new redblack applet