Kruskal's Alg o results in a MST.

Choose the edge with the smallest weigth.

recursivley keep choosing the smallest edges but making sure all the vertices are getting covered but no cycles ar ebeing formed.

Time Complexity: O(E log E)

E: is the number of edges.

Kruskal's Algo

results matching ""