- [[Spanning Tree Algorithms]] - given a weighted undirected graph $G = (V, E)$, find the lightest weight tree that connects all vertices in $V$ - the lightest weight edge across any non-trivial cut must be part of every possible MST in the graph