## minimum spanning trees #

Say you have a graph `G`

. A *minimum spanning tree* (or MST, or min span tree) is a `...TODO...`

## kruskal’s algorithm #

Kruskal’s algorithm builds an MST by `...`

## prim’s algorithm #

Compared to Kruskal, Prim’s algorithm uses `...`

## boruvka’s algorithm #

Now we’re getting deep into the weeds here. `...`