SOLUTION: Is it A? I want to check my answer. Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm? A. 30 B. 31 C. 28 D. 40 The qu

Algebra ->  Probability-and-statistics -> SOLUTION: Is it A? I want to check my answer. Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm? A. 30 B. 31 C. 28 D. 40 The qu      Log On


   

Question 1160965: Is it A? I want to check my answer.
Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm?
A. 30
B. 31
C. 28
D. 40

The question is provided in the link here: https://i.imgur.com/FngP2bs.png
Answer by MathLover1(20849) About Me  (Show Source):
You can put this solution on YOUR website!

yes, answer is A. 30

you have 8 vertices=> shade 7 edges
numbers on edges to shade are:
5,2,1,6,4,3,and 9