Prim's Algorithm

Steps:

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

Data Depiction:

Click here to learn more about the algorithm.