disjoint_set_union · www.studyline.ai

← Study

Concept You are learning about

▶Disjoint Set Union / Union Find

part of minimum spanning tree

📂 Overview
- ↳ ℹ️ Summary
  general
⚡ Flashcards

Study: Disjoint Set Union / Union Find

Flashcards

1 / 0

🌁 Switch to Slideshow

data_structure algorithm adt union_find disjoint_set path_compression union_by_rank union_by_size forest equivalence_relation

🔥 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 →