Prim's Algorithm

Finding the minimum spanning tree

1. Pick start vertex S
2. Add S as root of tree T
3. For each of (V - 1) iterations: choose lowest edge that connects a new vertex to the tree