Concepts3
⚙️AlgorithmIntermediate
MST Properties and Applications
An MST minimizes total edge weight over all spanning trees and has powerful properties such as the cut and cycle properties that guide correct, greedy construction.
#minimum spanning tree#kruskal#prim+12
⚙️AlgorithmIntermediate
Minimum Spanning Tree - Kruskal
Kruskal’s algorithm builds a minimum spanning tree (MST) by sorting all edges by weight and greedily picking the next lightest edge that does not form a cycle.
#kruskal#minimum spanning tree#mst+11
🗂️Data StructureIntermediate
Disjoint Set Union (Union-Find)
Disjoint Set Union (Union-Find) maintains a collection of non-overlapping sets and supports fast merging and membership queries.
#disjoint set union#union-find#path compression+11