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?

  1. A.

    I only

  2. B.

    II only

  3. C.

    Both I and II

  4. D.

    Neither I nor II

Attempted by 242 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…