Prim's Algorithm
Minimum spanning tree grown from one vertex, always adding the cheapest edge leaving the tree.
Intermediate
with a priority queue; good for dense graphs.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.