Shortest Path Problem - Dijkstra's Algorithm
Recommendation |
Unrated |
||||
Link |
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml.en |
||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
Kenji Ikeda |
||||
Institution |
University of Tokushima |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Easy-to-follow implementation of Dijkstra's algorithm. No controls necessary; clicking the graph works through one step of the process. |
||||
Evaluation |
Strengths: easy to follow; 10 developer-supplied data sets; shows edges as either used or not used. Weaknesses: no continuous operation; no user-defined data sets |
||||
|
|||||
Teaching the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-18 |
||||
Last Visited |
2006-04-18 |
||||
Last Updated |
2004-09-17 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
