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.

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.

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.