8. Let's for an undirected graph |V]=10, JE|= 13 and [T|=0, and weights are given as...

Transcribed Image Text:

8. Let's for an undirected graph |V]=10, JE|= 13 and [T|=0, and weights are given as follows- (u,v) (5,8) (2,3) (1,2) (3,6) (2,8) (3,4) (6,9) (1,3) (2,5) (6,7) (9,10) (8,10) (2,10) w(u,v) 3 5 6. 8. 10 12 14 15 7 10 Construct Minimum Spanning Tree using Kruskal's Algorithm and Prim's algorithm. Compare the result. 8. Let's for an undirected graph |V]=10, JE|= 13 and [T|=0, and weights are given as follows- (u,v) (5,8) (2,3) (1,2) (3,6) (2,8) (3,4) (6,9) (1,3) (2,5) (6,7) (9,10) (8,10) (2,10) w(u,v) 3 5 6. 8. 10 12 14 15 7 10 Construct Minimum Spanning Tree using Kruskal's Algorithm and Prim's algorithm. Compare the result.

Answer rating: 100% (QA)

uv 58 23 12 36 28 34 69 13 25 67 910 810 210 Wuv 3 5 6 7 8 9 10 12 14 15 7 3 10 Kruskals Algorithm STEP 1 Arrange the vertices in the decreasing order of their weight Thus the modified table will be g... View the full answer