SOLUTION: Is it A? I want to check my answers. 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 q

Algebra ->  Probability-and-statistics -> SOLUTION: Is it A? I want to check my answers. 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 q      Log On


   

Question 1160946: Is it A? I want to check my answers.
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(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

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

As I noticed in my yesterday post, THERE IS NO such a term "Kurscal's algorithm".

There is a term "Kruskal's algorithm", named after Joseph Kruskal,
an American mathematician, statistician, computer scientist and psychometrician.



See these Wikipedia articles

https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
and
https://en.wikipedia.org/wiki/Joseph_Kruskal


So, correct this error/typo in the post and say to your professor about this mistake.


Do not forget to post your  "THANKS"  to me,  since   I work for you   and   on your side,  fixing yours  (or your professor)  errors.

You may do not know the names of mathematicians;  but I know them . . .