Algorithms | Graph Traversals | Question 9

Last Updated :
Discuss
Comments

Which of the following condition is sufficient to detect cycle in a directed graph?

There is an edge from currently being visited node to an already visited node.

There is an edge from currently being visited node to an ancestor of currently visited node in DFS forest.

Every node is seen twice in DFS.

None of the above

This question is part of this quiz :

Top MCQs on Graph Traversals with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
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