SOLUTION: 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: ht

Algebra ->  Sequences-and-series -> SOLUTION: 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: ht      Log On


   

Question 1160977: 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
Found 2 solutions by MathLover1, ikleyn:
Answer by MathLover1(20850) About Me  (Show Source):
You can put this solution on YOUR website!

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

Answer by ikleyn(52864) About Me  (Show Source):
You can put this solution on YOUR website!
.

There is no a "Kurskal's Algorithm".

There is the "Kruskal's Algorithm", instead.