engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Let G be any connected, weighted, undirected graph.
I. G has a unique minimum spanning tree, if no two edges of G have the same weight.
II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?1
I only
2
II only
3
Both I and II
4
Neither I nor II