Prim's Minimum Spanning Tree

graphs

Best O((V + E) log V)Avg O((V + E) log V)Worst O((V + E) log V)Space O(V)

Preparing Prim's Minimum Spanning Tree...

Grows an MST from a starting node by continually adding the cheapest edge connecting the tree to unvisited nodes.