Graph AlgorithmsPrim's MST
Prim's MST
Grows a minimum spanning tree from a start node by repeatedly adding the cheapest edge to a new vertex.
Advancedminimum spanning treegreedypriority queueweighted
Loading visualization…
Grows a minimum spanning tree from a start node by repeatedly adding the cheapest edge to a new vertex.