Apply Kruskals Algorithm Find Minimum Spanning Tree Graph Q37071545

Apply Kruskals algorithm to find a minimum spanning tree of thegraph

Answer

a-0 b-1 c-2 d-3 e-4 f=5

Now check there is any cyclesfor Kruskals there should be no cycles

The minimum spanning tree is given above figure

3 Kruskal’s Algorithm Edges are sorted in increasing order of weight: (1,(0,3)), (1,(6,5)), (2,(2.5)), 2 5 3 7 6 4 8 6

OR

 

OR