Disjoint Set Union / Union Find

Disjoint Set Union / Union Find

data_structure algorithm adt union_find disjoint_set path_compression union_by_rank union_by_size forest equivalence_relation
💬 Click on the content to Ask AI
Explore More:
🔥 Minimum Spanning Tree → In Kruskal’s MST algorithm, DSU tracks connected components: find checks if an edge’s endpoints are in different sets (no cycle), and union merges components when the edge is chosen, enabling efficient, near-linear MST construction.
🔥 Kruskal Algorithm → Kruskal's algorithm relies on DSU to maintain connected components via fast find/union (with path compression and union by rank), enabling efficient cycle checks and safe edge additions.
Maximum Spanning Tree →