* create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o