* 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 if that edge connects two different trees, then add it to the forest, combining two trees into a single tree

o otherwise discard that edge.



At the termination of the algorithm, the forest has only one component and forms a minimum spanning tree of the graph.-　　* 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 if that edge connects two different trees, then add it to the forest, combining two trees into a single tree

　　　　　o otherwise discard that edge.



At the termination of the algorithm, the forest has only one component and forms a minimum spanning tree of the graph.