KnowraKruskal's algorithmLinked fromLinked fromThe 4 pages that link to Kruskal's algorithm, each with the reason it gives.All 4Broader topic 2Related 1Compared with 1Greedy 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.Spanning treeRelated: It constructs a spanning tree by rejecting edges that would create cycles.Prim's algorithmCompared with: Unlike Prim's, it selects globally light edges rather than extending one growing tree.