MadeEasy Test Series: Algorithms - Greedy Algorithm

Question

Consider the following graph:

If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.

My Strategy :- 

According to me a = 11 (because if we see the cycle ABD then the edge weight a should be atleast greater then the max edge and since all the edge weight are unique it cant be 10)

and likewise g = 11,f = 12,b = 8,e = 8,d = 9,c = 6.Hence Sum is = 65

Made Easy Solution :- 

Comments

Made Easy solution is correct.
Edge weights are distinct. Its given in the question. You have used 6,11 etc multiple times.

---

Oh no i did silly mistake ohk i got it. But my concept was right isn't it?

---

Yes... It's correct.

Answer 1

According to me MADE EASY solution is wrong because if you would have noticed in the graph that there is no edge with weight '4' and question is about minimum.

4 can be assigned to any unknown weight edge.

Then sum will be:-   4+8+9+11+12+13+14=71

Comments

yes 71 according to me is right answer

---

Then 4 would be present in the minimum spanning tree, but the minimum spanning tree is already given, so 4 cannot be included