GALGO - Dijkstra's Algorithm
Recommendation |
Has Potential |
||||
Link |
http://www.informatik.fb2.fh-frankfurt.de/~hoebel/graphen/galgo/ (German version); http://www.informatik.fb2.fh-frankfurt.de/~hoebel/graphen/galgo/en/index.html (English version) |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
German; English |
||||
Author |
Natascha Hoebel; Martin Burrer |
||||
Institution |
University of Applied Siences, Frankfurt |
||||
Project |
|||||
Works |
Yes |
||||
Description |
User either selects or creates a graph, and then runs Dijkstra's single-source shortest paths algorithm on it. A separate window shows the table for the shortest path distances. |
||||
Evaluation |
Sophisticated graph editing capabilities. The AV portion is a straight animation. The English version is only partly translated. |
||||
Canned Data; Animation |
|||||
Lecture Aid; Teaching the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2009-04-21 |
||||
Last Visited |
2009-05-01 |
||||
Last Updated |
2003 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
