Auckland - Dijkstra's Algorithm
|
- Works?
- Yes
- Delivery Method(s)
- Java Applet
- Project
- Morris' Collection
- Project Relationship
- Part of collection
- Language(s)
- English
- Mervyn Ng, Woi Ang, John Morris
- Institution(s)
- University of Auckland
- Activity Level(s)
- Animation, Canned data, Step control
- Source Code License
- Unavailable
- First Published
- N/A
- Last Modified
- 1998
- Description
Typical depiction of Dijkstra's algorithm.
- Evaluation
Strengths: Two developer-defined data sets; pseudo-code follows along; choice of stepwise or continuous operation. Weaknesses: No ability to include user-defined data sets; not clear how the nodes remember their predecessor; awkward terminology ("relax all adjacent nodes"); the algorithm presentation is just hard to follow. Once the algoirthm terminates, the graph shows the links followed to visit each vertex, but the coloring is such that this is really difficult to pick out. There is no table at the end showing the shortest distances.
- Usage Notes
- Field Report(s)
- Field Report: 1
- References
- N/A
- AV of the Day
- No
- Score
- 35
