Kruskal’s MST Algorithm
Kruskal’s MST Algorithm
Create a forest of trees numbered 1 to |V|
Sort Edges by increasing weight
For each edge (x,y) do {in ascending order by weight}
if vertices x and y are in different trees
Add (x,y) to the spanning tree
Renumber all vertices in x’s tree using y’s number
endif
endfor