You can help the community by contributing reviews and ratings to the catalog.
Here is a detailed description for the catalog entry structure.
Virginia Tech - Union/Find
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Chris Kania; Cliff Shaffer |
||||
Institution |
Virginia Tech |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Allows users to select set sizes of from 8 to 20 nodes, and then perform union operations on them. The result on the disjoint set is shown. Steps are explained as the user makes the connections. Shows both the union/find physical array and the logical (tree) view. |
||||
Evaluation |
The message panel clearly explains each step. Shows results either with or without path compression. Changes in the trees shown with animation and color. Should be a good way to show students a data structure and algorithm that they often have trouble with. |
||||
Step Control; User Data |
|||||
Teaching the Concept; Lecture Aid; Exploring the Concept |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
This is a Java applet, so it should start automatically when you click on the link above. To union (combine) two items, first set the values that you want using the up/down arrows in the controls at the bottom left of the applet, and then click the "Union" button. You will then repeatedly click the "Next" button until that operation is complete (and the "Next" button greys out). Then repeat by selecting two more items to union together. |
|||||
First Visited |
2006-07-26 |
||||
Last Visited |
2009-08-23 |
||||
Last Updated |
2006-07-26 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
4.0
UNM UnionFind
Recommendation |
Unrated |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
|
||||
Language |
English |
||||
Author |
|
||||
Institution |
University of New Mexico |
||||
Project |
|||||
Works |
|
||||
Description |
|
||||
Evaluation |
|
||||
|
|||||
|
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
|
||||
Last Visited |
|
||||
Last Updated |
|
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
ALVIE - Union/Find
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 Union/Find algorithm. |
||||
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/unionFind.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. |