Glossary: Algorithms Beyond the Basics in Go

Kruskal's algorithm

Also written: Kruskal

Builds a minimum spanning tree by going through edges from shortest to longest, keeping each one that joins two not-yet-connected places. It uses union-find to check.