- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Graph Traversals | Question 1
Last Updated :
Discuss
Comments
Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph ?
Depth First Search
Breadth First Search
Prim\'s Minimum Spanning Tree Algorithm
Kruskal\' Minimum Spanning Tree Algorithm
This question is part of this quiz :
Top MCQs on Graph Traversals 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