Recommendation

Recommended

Link

http://research.cs.vt.edu/AVresearch/UF/

Delivery Method

Java Applet

License

GPL

Language

English

Author

Chris Kania; Cliff Shaffer

Institution

Virginia Tech

Project

Virginia Tech Algorithm Visualizations

RelationshipToProject

PartOfCollection

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.

ActivityLevel

Step Control; User Data

GoodFor

Teaching the Concept; Lecture Aid; Exploring the Concept

Screenshots

Videos

References

HowToUse

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

UnionFind

Community

Edit

You may edit this entry if you have an account.