Prim's algorithm for constructing a min cost spanning tree.

empty minimum spanning tree T
choose start vertex v
add v to T
while (there is a vertex not in T) {
   choose least cost edge e from some vertex in T to some vertex not in T
   add edge e to T
}