Skip to content

Glossary: Algorithms Beyond the Basics in Java

Kruskal's algorithm

Also written: Kruskal

Builds a minimum spanning tree by going through roads from shortest to longest and keeping each one that joins two places not yet connected, checked with union-find.

Where the book teaches it

Related terms

minimum spanning treeunion-findPrim's algorithm