Auckland - Dijkstra's Algorithm
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Mervyn Ng; Woi Ang; John Morris |
||||
Institution |
University of Auckland |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Typical depiction of Dijkstra's algorithm. |
||||
Evaluation |
Strengths - multiple developer-defined data sets; pseudo-code follows along; stepwise and continuous operation. Weaknesses - no user-defined data sets; not clear how the nodes remember their predecessor; the algorithm presentation is just hard to follow. |
||||
Step Control; Animation; Canned Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-18 |
||||
Last Visited |
2008-07-17 |
||||
Last Updated |
1998 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
