In Kruskal Algorithm, the edges of a connected weighted graph are examined one by one in order of increasing weight.