minimum_spanning_tree · www.studyline.ai

Study: Minimum Spanning Tree (MST)

Flashcards

1 / 4

🌁 Switch to Slideshow

Question Count: 3

graph_theory graph tree spanning_tree spanning_subgraph weighted_graph undirected_graph connected_graph combinatorial_optimization matroid

→ shortest path

🔥 kruskal algorithm → Kruskal’s algorithm computes a minimum spanning tree; its goal and correctness rely on MST definitions and properties (cut and cycle), guiding edge selection and stopping criteria.

🔥 prim algorithm → Prim's algorithm uses the MST problem and its cut/cycle properties to make greedy edge selections and to define its goal of constructing a minimum spanning tree.

🔥 disjoint set union → In Kruskal’s MST algorithm, a Disjoint Set Union is used to maintain connected components and test whether adding an edge would create a cycle; union/find with path compression and union by rank enables near-linear-time MST construction.

🌟 boruvka algorithm →

🌟 priority queue adt →

⚡️ network design →

⚡️ clustering →

⚡️ edmonds-chu-liu algorithm →

⚡️ maximum spanning tree →

⚡️ greedy algorithm →