Computer Sciences > Gate 2017 Set-1 > Graph Theory
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
Which of the above statements is/are necessarily true?
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices 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?
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.