Skip to content

Glossary: Algorithms Beyond the Basics in Rust

Kruskal's algorithm

Also written: Kruskal

A way to build a minimum spanning tree by going through roads from shortest to longest and keeping each one that joins two places not yet connected. It uses union-find to check this.

Where the book teaches it

Related terms

Minimum spanning treeUnion-findPrim's algorithmGreedy algorithm