Closed AshutoshKr17 closed 3 years ago
Kruskal's algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which
-form a tree that includes every vertex -has the minimum sum of weights among all the trees that can be formed from the graph
Kruskal's algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which
-form a tree that includes every vertex -has the minimum sum of weights among all the trees that can be formed from the graph