A minimum spanning tree (MST) is a special kind of tree that minimizes the weight of...

   

Transcribed Image Text:

A minimum spanning tree (MST) is a special kind of tree that minimizes the weight of the edges of the tree. a) Find the MST of this tree in Figure Q2(a) using Primm's algorithm. 10 Marks Draw the MST and show the calculation of MST cost. A 10 5 1 B 14 D 0 9 2 7 E F 6 8 10 13 A minimum spanning tree (MST) is a special kind of tree that minimizes the weight of the edges of the tree. a) Find the MST of this tree in Figure Q2(a) using Primm's algorithm. 10 Marks Draw the MST and show the calculation of MST cost. A 10 5 1 B 14 D 0 9 2 7 E F 6 8 10 13

Answer rating: 100% (QA)

Prims algorithm This algorithm starts with an arbitrary vertex and adds the minimum weight edge to the MST that connects it to the rest of the graph I... View the full answer