Learning to find the minimum weight subset of edges that connects all vertices in a graph, using Kruskal's and Prim's algorithms.
A greedy algorithm that finds an MST by sorting edges and adding them if they don't form a cycle.
A greedy algorithm that finds an MST by growing a tree from a single vertex.
A data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets.