Union-Find (Disjoint Set Union)
Path Compression & Union by Rank ā Step by Step
Click "Next Step" to begin the Union-Find demonstration
š³ Parent Pointer Forest
š Arrays
Vertex
parent[]
rank[]
š Operation Log
Root node
Regular node
Path being followed
Compressed by Find
Parent pointer
Reset
ā Previous
Next Step ā
Auto Play