DT Q33

Home
DT Q33

33The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is _______.

Option : A
Explanation :
MST, The complete graph should be

Total sum = 10 + 9 + 2 + 15 + 16 + 7 + 4 + 6 = 69

Forgot your password?

I agree with the Terms.