This module provides support for the very famous Dijkstra's Algorithm.
We follow the long and established tradition of describing this algorithm in the context of the classical shortest path problem. So the problem is to determine the shortest path between two given nodes of a network. It is assumed that the length of the arcs are not negative.
On the positive side, Cycles are welcome!. As usual, the length of a path is equal to the sum of the arc lengths on the path.
Two sub-modules are provided:
- An interactive graphical version for a particular problem.
- A spread-sheet like version for custom made user-defined problems.
If you have not used Dijkstra's Algorithm before, we suggest that you have a quick look at the interactive graphical version before you use the spread-sheet like version to solve your own shortest path problems. This is just an advice. You are welcome to use any one of the two sub-modules.