Solve the minimal-spanning tree problem defined below:
A) total cost = 13
B) total cost = 15
C) total cost = 17
D) total cost = 11
E) None of the above

Question

Solve the minimal-spanning tree problem defined below: 
A) total cost = 13 
B) total cost = 15 
C) total cost = 17 
D) total cost = 11 
E) None of the above

Quizplus · Accepted Answer

Using Kruskal's algorithm to find the minimal spanning tree, we start with the smallest edge (weight 1) and continue adding edges in increasing order of weight until we span all vertices. The resulting tree has a total cost of 15, as shown below:

1-3 (cost 1)
3-4 (cost 2)
4-5 (cost 2)
5-2 (cost 4)
2-6 (cost 6)

Therefore, the correct answer is choice B: total cost = 15.

Solve the Minimal-Spanning Tree Problem Defined Below