Let πΊ be any connected, weighted, undirected graph.
Q. Let πΊ be any connected, weighted, undirected graph.
- πΊ has a unique minimum spanning tree, if no two edges of πΊ have the same weight.
- πΊ has a unique minimum spanning tree, if, for every cut of πΊ, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?
(A) I only
(B) II only
(C) Both I and II
(D) Neither I nor II
Ans: Β Both I and II