edited by
816 views
0 votes
0 votes

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 (abcdefg) 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 :- 

edited by

1 Answer

0 votes
0 votes
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
reshown by

Related questions

0 votes
0 votes
1 answer
1
Na462 asked Apr 30, 2018
4,367 views
Consider the following message:The number of bits required for huffman encoding of the above message are __________?My Strategy:- But the answer given is 52bits i used st...