Data Structure Visualization - Topological Sort
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 |
From a choice of two graphs, user sees an animation showing queue-based topological sort. That is, the algorithm first counts the in-degree of each node, then starts pulling off and processing 0-degree nodes. User can select random graphs from one of two sizes. |
||||
Evaluation |
Can view this as a straight animation (not recommended) or by steps. Unfortunately, it is a little tricky to figure out how to get it into step mode. No explanation of the process is given, so it is hard to tell what is going on. |
||||
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. |
