Prim's Algorithm
Prim's algorithm is also used to find a minimum spanning tree
Prims Algorithm
- Choose any vertex to start the minimum spanning tree.
- Select an arc of least weight that joins a vertex not already in the tree (If there is a choice between two arcs of equal weight, then choose either).
- Repeat step 2 until all the vertices are connected.