KnowraPrim's algorithmLinked fromLinked fromThe 4 pages that link to Prim's algorithm, each with the reason it gives.All 4Broader topic 1Related 2Compared with 1Greedy algorithmBroader topic: It grows a tree through locally cheapest safe edges, illustrating a different greedy construction.Spanning treeRelated: It expands a connected tree until every vertex is included.Priority queueRelated: A priority queue selects the least-cost edge crossing the growing tree's boundary.Kruskal's algorithmCompared with: It builds outward from a tree, unlike Kruskal's global edge ordering.