GATE Computer Science (CS) 2017 Shift 1 Solved Paper
© examsiri.com
Question : 36 of 65
Marks:
+1,
-0
Let 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?
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?
Go to Question: