~ M 1 1 d 1 weights ab= 2 bc= 2 ac = 8 bd 1...

 

Transcribed Image Text:

~ M 1 1 d 1 weights ab= 2 bc= 2 ac = 8 bd 1 cd be de cf Spanning tree minimum = = 2 6 = 1 = I = = 3 To Find the weighted graph ot & Apply the Kruskal algorithm step by step Apply the Prim Algorithm step by step (Storting in the above vertex a ~ M 1 1 d 1 weights ab= 2 bc= 2 ac = 8 bd 1 cd be de cf Spanning tree minimum = = 2 6 = 1 = I = = 3 To Find the weighted graph ot & Apply the Kruskal algorithm step by step Apply the Prim Algorithm step by step (Storting in the above vertex a

Answer rating: 100% (QA)

Kruskals algorithm Sort all edges in increasing order of their weight Pick the smallest edge Check if the new edge creates a cycle or loop in a spanni... View the full answer