Prim's Algorithm
Finding the minimum spanning tree
Pick start vertex S
Add S as root of tree T
For each of (V - 1) iterations: choose lowest edge that connects a new vertex to the tree
Link to Prim's Algorithm on Wikipedia