System requirements:

• python (http://python.org/)

• wxPython (http://www.wxpython.org/)

• pythoncard (http://pythoncard.sourceforge.net/)

• OS: Win, Lin, Mac, any python-enabled OS should do

Dijkstra's Shortest Path Algorithm Demo

Download: dijkstra.zip (v 0.42b)

How to use

1. Download, unzip and run, like this(linux):

$ unzip dijkstra.zip
$ cd dijkstra
$ python dijkstra.py

2. In the running application select File -> Import and load a file called map.xyz (in the same directory as dijkstra.py).

3. Click anywhere on the map to set the starting point and another click to set the end point, after that you should see a blue line connecting the two points.

Extra visualisation

If you want to see how dijkstra does the trick, use the shell window and type:

Note: you only have to type the last line: self.showplague = True