Discrete Structures20765 marksMinimum Spanning Trees
What is minimum spanning tree? Explain Kruskal's algorithm for finding minimum spanning tree.
What is minimum spanning tree? Explain Kruskal's algorithm for finding minimum spanning tree. [5]
Let G be a connected weighted graph. The weight of a spanning tree of G is the sum of the weights of the edges included in that spanning tree. A Minimum Spanning Tree (MST) of G is a spanning tree of G with the minimum possible weight among all possible spanning trees of that graph. Example use c...