Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
GATE | GATE CS 2019 | Question 47
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.
(A)
Neither I nor II
(B)
I only
(C)
II only
(D)
Both I and II
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks