This tiny program demonestrates the Dijkestra algorithm. It can be used in Algorithm design courses to teach Dijkestra algorithm to students.
The graphical enivronment of this program allows user to see what is happening during algorithm excution step by step.
Click on the black area to add nodes to the network, then connect nodes by right click on nodes and set a distance on edges, then use Dijkestra algorithms to find shortest path
