Study

Disjoint Set Union / Union Find

⚡️ Flashcards 🌁 Slideshow

Flashcards

1 / 0

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

Study More...

🔥 Minimum Spanning Tree → Enables → Disjoint Set Union / Union Find DSU provides the connectivity abstraction and fast cycle detection needed to build MSTs via Kruskal.

🔥 Kruskal Algorithm → Enables → Disjoint Set Union / Union Find DSU drives the efficiency of Kruskal by providing near-constant-time connectivity queries and merges, making the greedy edge selection practical at scale.

Maximum Spanning Tree →

🔥 ← Minimum Spanning Tree

Ask AI