Data Structure Visualization - Floyd/Warshall All-Pairs Shortest Paths
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows Floyd's algorithm for all-pairs shortest paths using dynamic programming. |
||||
Evaluation |
Reasonable attempt to demonstrate what is not the easiest algorithm to visualize. The table updates could be more clear, and step-by-step explanations, perhaps with pseudocode, are needed. |
||||
Animation; Step Control; Random Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-02 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
