ALVIE - Kruskal's Algorithm
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
By Request |
||||
Language |
English |
||||
Author |
Pilu Crescenzi |
||||
Institution |
University of Florence |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Walkthrough showing Kruskal's Algorithm for computing the Minimal Cost Spanning Tree |
||||
Evaluation |
Simple-to-use user interface for walking through the example. Simply open up the AV (see directions below) and step through the example with pseudo-code. As you go through the example, you are directed to the corresponding line in the pseudocode and given a line or two of explanation in the message window. Attractive layout of the data, including colors. |
||||
Step Control; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
http://sites.google.com/site/alviehomepage/alvie3/downoads/kruskal.swf |
||||
References |
|
||||
Download and unzip the ALVIE system from the website. Double click on the .jar file. Within the ALVIE pane (not the GRIND pane), click on the "eye" icon (third icon from the left in the toolbar) to get a list of algorithms from which select the AV that you want. Once selected, click OK and step through the AV with the arrow icons. |
|||||
First Visited |
2010-01-29 |
||||
Last Visited |
2010-01-29 |
||||
Last Updated |
2009-12-20 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
