Minimum Spanning Tree (MST)
A Minimum Spanning Tree connects all vertices in a weighted, undirected graph with minimum total edge cost and no cycles.
Minimum Spanning Tree (MST): Kruskal vs Prim (DSU)
Learn what a minimum spanning tree is + MST algorithm steps. Kruskal (Union-Find) O(E log E) vs Prim (heap) O(E log V). Practice now.