Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | CS | 2019 | Algorithms | Minimum Spanning Tree | Question 47
Last Updated :
Discuss
Comments
Let G be any connection, 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 G, there is a unique minimum weight edge crossing the cut.
Which of the above two statements is/are TRUE?
Neither I nor II
I only
II only
Both I and II
This question is part of this quiz :
GATE CS 2019,Algorithms GATE CS PYQ Quiz,Minimum Spanning Trees /Shortest Path Algorithms GATE CS PYQ QuizShare your thoughts in the comments
GeeksforGeeks