Linked from

The 4 pages that link to Kruskal's algorithm, each with the reason it gives.

• Greedy algorithmBroader topic: Its edge-by-edge choices are justified by the cut property of minimum spanning trees.

• MatroidBroader topic: It is the graphic-matroid instance of greedy optimization.