Skip to content

Glossary: Algorithms Beyond the Basics in Java

minimum spanning tree

Also written: MST

The cheapest set of edges that links every vertex, with no loops. For Alex it is the fewest plowed minutes that keep every place reachable.

Where the book teaches it

Related terms

Kruskal's algorithmPrim's algorithmunion-find