- used to solve [[Minimum Spanning Trees (MST)]] - on each iteration, pick the lightest edge between a vertex in the current subtree $S$ and a vertex outside $S$ - runtime is $O(|E|\,log(|V|))$