The Algorithm Visualization Catalog is a comprehensive collection of links to algorithm visualizations, or AVs.

Animal - Minimum Cost Spanning Tree

Link(s)
http://www.algoanim.info/AnimalAV
Topic(s)
Minimum spanning tree, Graph Algorithms



Recommendation
  
Lecture Aide Not Recommended
Self-study Supplement Not Recommended
Standalone Not Recommended
Debugging Aide Not Recommended
Works?
Yes
Delivery Method(s)
Animal Animation
Project
Animal
Project Relationship
Part of project
Language(s)
English, German
Author(s)
André Flöper, Guido Rößling
Institution(s)
TU Darmstadt, Darmstadt, Germany
Activity Level(s)
Animation, Canned data, Step control
Source Code License
Non-commercial use only
First Published
N/A
Last Modified
N/A

Description

Presents a slideshow with examples for Prims and Kurskal’s algorithms.

Evaluation

Generally clear presentation, but with some serious content flaws. The Kruskal’s AV doesn’t get across the relationship to disjoint sets, which is a fundamental part of the algorithm. The analysis is basically wrong, stating that Kruskal’s is |E| log |E|, Prims is |V|^2, and so Kruskal’s is cheaper. In fact, the cost of Prim’s depends on how the next vertex is found, and the denseness of the graph. Thus, the AV’s analysis is oversimplified and misleading.

Usage Notes

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.

Field Report(s)
References
N/A
Rating
0
No votes yet
Your rating: None
AV of the Day
No
Score
18