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

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) (Show Source): You can put this solution on YOUR website!

answer is A.

you have vertices=> shade edges
numbers on edges to shade are:
,,,,,,and
Answer by ikleyn(52864) (Show Source): You can put this solution on YOUR website!
.

There is no a "Kurskal's Algorithm".

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

RELATED QUESTIONS
Is it B? I want to check my answer. Which is the cost of the minimum spanning tree of... (answered by MathLover1)
Is it B? I want to check my answer. Which is the cost of the minimum spanning tree of... (answered by Theo)
Is it A? I want to check my answer. Which is the cost of a minimum spanning tree of... (answered by MathLover1)
Is it A? I want to check my answers. Which is the cost of a minimum spanning tree of... (answered by MathLover1,ikleyn)
Which is a correct statement regarding a weighted mean? A) A weighted mean is... (answered by MathLover1)
Determine which set of numbers can be the measures of the sides of a right triangle. a. (answered by Alan3354,richwmiller,arKed,MathTherapy)
supppose 2 acid solutions are mixed. One is 26% acid and the other is 34% acid. Which... (answered by scott8148)
two acid solutions are mixed, one is 26% one is 32% which of the following concentrations (answered by Alan3354)
1.Which portion could be used to solve for the height of the tree?... (answered by user_dude2008)