Glossary: Algorithms Beyond the Basics in Go

Minimum spanning tree

Also written: MST, spanning tree

The cheapest set of edges that links every vertex, with no loops. Alex uses one to pick the fewest plowed road minutes.