The graph shown below has 8 edges with distinct integer edge weights. The…
GATE · 2015 · CS · Set 1 · Computer Science & IT
The 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 ___________.
Attempted by 174 students.
Sign up free to check your answer
Sign up freeLoading lesson…