Minimum Routes Finder
Recommendation |
Unrated |
||||
Link |
http://students.ceid.upatras.gr/~papagel/project/kef5_7_1.htm |
||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
Papagelis Athanasios |
||||
Institution |
University of Patras |
||||
Project |
UPatras Collection |
||||
Works |
Yes |
||||
Description |
Fairly technical explanation and visualization. This seems to be geared towards dynamic programming and mathematics students rather than a computer science understanding. |
||||
Evaluation |
Strengths: stepwise and continuous operation; random data sets. Weaknesses: no user defined data sets; may not implement Dijkstra's algorithm exactly right (or uses a shortcut not declared). |
||||
|
|||||
Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-18 |
||||
Last Visited |
2006-04-18 |
||||
Last Updated |
1997-10-15 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
