unions
none — loose dots
chain order: union(i, i-1)
doubling order: pair, then pair the pairs
random pairs
n
8
16
32
union by rank
path compression
union random ▸
12 random finds
find the deepest
reset
|
click a node to
find
it · drag one onto another to
union
every root sits on the top line, so a node's row is its depth — and its depth is what finding it costs · u unions · q storms · f finds the deepest · c compression · k rank · r resets