Editing Kruskal's algorithm (section)

==Pseudocode==
The following code is implemented with a [[disjoint-set data structure]]. It represents the forest ''F'' as a set of undirected edges, and uses the disjoint-set data structure to efficiently determine whether two vertices are part of the same tree.

 '''function''' Kruskal(''Graph G'') '''is'''
     F:= ∅
     '''for each''' v '''in''' G.Vertices '''do'''
         MAKE-SET(v)
 
     '''for each''' {u, v} '''in''' G.Edges ordered by increasing weight({u, v}) '''do'''
         '''if''' FIND-SET(u) ≠ FIND-SET(v) '''then'''
             F := F ∪ { {u, v} }
             UNION(FIND-SET(u), FIND-SET(v))
     '''return''' F