graphs vertexinitially containing just that vertex that corresponds to the set in the example in fig there are initially sets each containing one vertex the algorithm proceeds as follows until | |- edges have been added to the set of spanning tree edges the next shortest edge is examined if the two vertex end points of the edge are in different setsthen the edge may be safely added to the set of spanning tree edges new set is formed from the union of the two vertex sets and the two previous sets are dropped from the list of vertex sets if the two vertex endpoints of the edge are already in the same setthe edge is ignored that' the entire algorithm the algorithm is greedy because it always chooses the next smallest edge unless doing so would form cycle if cycle would be formed by adding an edgeit is known right away without having to undo any mistake or backtrack consider fig in this snapshot the algorithm has already formed forest of treesbut not spanning tree yet the edges in orange are part the spanning tree fig kruskal'ssnapshot this copy belongs to 'acha