- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Graph Minimum Spanning Tree | Question 6
Last Updated :
Discuss
Comments
Consider the following graph:
Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm?
(a—b),(d—f),(b—f),(d—c),(d—e)
(a—b),(d—f),(d—c),(b—f),(d—e)
(d—f),(a—b),(d—c),(b—f),(d—e)
(d—f),(a—b),(b—f),(d—e),(d—c)
This question is part of this quiz :
Top MCQs on Minimum Spanning Tree (MST) in Graphs with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy