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