engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
In a graph G each edge has a distinct weight, and e is the heaviest edge in G. Which of the following statements about the minimum spanning trees is/are true?
I. Every minimum spanning tree of G excludes e.
II. Every minimum spanning tree of G exclude e if is present in some cycle of G.
1
Only I
2
Only II
3
Both I and II
4
Neither I nor II