Virginia Tech - Union/Find

Link(s)
http://research.cs.vt.edu/AVresearch/UF/
Topic(s)
disjoint set, Union-find

Screenshots
Virginia Tech Union/Find Screenshot


Recommendation
  
Lecture Aide Recommended
Self-study Supplement Recommended
Standalone Has Potential
Debugging Aide Recommended
Works?
Yes
Delivery Method(s)
Java Applet
Project
Virginia Tech Algorithm Visualizations
Project Relationship
Part of collection
Language(s)
English
Author(s)
Chris Kania, Cliff Shaffer
Institution(s)
Virginia Tech
Activity Level(s)
Step control, User data
Source Code License
Licensed under GPL
First Published
N/A
Last Modified
2009-01-26
Awards
AlgoViz.org Award Nominee - 2010

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 are shown with animation and color. This visualization should be a good way to explain a data structure and algorithm that students often have trouble understanding.

Usage Notes

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.

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