Gate2017 cs Q56

56Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements:
(I) Minimum spanning tree of G is always unique.
(II) Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

Option : A
Explanation :

Shortest path from B to C are two B-A-C and B-C both of weight '3'

Forgot your password?

I agree with the Terms.