the next shortest edgethe edge from vertex to vertex is currently being considered the set containing and is the set { adding the edge with end points and cannot be done because vertices and are already in the same set sothis edge is skipped it cannot be part of the minimum weighted spanning tree the next shortest edge is the edge between vertices and since is member of { and is member of its set in the previous paragraphthe edge { is added to the minimum weighted spanning tree edges and the new set { is formed replacing its previous two subsets as depicted in fig the next shortest edge is the edge between vertices and this edge again cannot be added since and are in the same set and therefore adding the edge would form cycle the next shortest edge is the edge between vertices and but again adding it would form cycle so it is skipped the algorithm proceeds in this manner until the resulting spanning tree is formed with | |- edges (assuming the graph is fully connectedfig kruskal'ssnapshot this copy belongs to 'acha