Let G = (V, E) be any connected undirected edge-weighted graph. The weights of…
PYQ LTIMindtree Hiring Assessment 2025
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?
- A.
I only
- B.
II only
- C.
Both I and II
- D.
Neither I nor II
Attempted by 242 students.
Sign up free to check your answer
Sign up freeLoading lesson…

