Welcome to Dijkstrta's Algorithm Module

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.

Four different modules are provided:

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.

And if you are really interested in this algorithm and would like to learn about its roots, you must read the DP perspective.

This is just an advice. You are welcome to use any one of these modules.

Contributed by

© The University of Melbourne 1994-2000.
Disclaimer and Copyright Information.
Conditions of use.

Date created: January 15, 2000
Date last modified: February 15, 2000
Authorised by: Moshe Sniedovich
Maintained by: Moshe Sniedovich, Department of Mathematics and Statistics.
Email: m.sniedovich@ms.unimelb.edu.au