Data Structure Visualization - Kruskal's Algorithm
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 Kruskal's minimal cost spanning tree. Along with the graph, there is an array and a list of edges. |
||||
Evaluation |
It is pretty much a mystery what is going on here. The vertex table and the accompanying list of edges don't really convey the concept of equivalence classes for the connected subgraphs at all. This presentation desperately needs step-by-step explanations. It is a little confusing as to how to get into step-by-step mode. |
||||
Animation; Step Control; Random Data |
|||||
Lecture Aid |
|||||
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. |
