Skip to content

Glossary: Algorithms Beyond the Basics in C++

Kruskal's algorithm

Also written: Kruskal

A greedy way to build a minimum spanning tree: go through roads shortest first and keep each road that joins two places not yet connected, using union-find to check.

Where the book teaches it

Related terms

minimum spanning treePrim's algorithm