Skip to content
Related Articles

Related Articles

Algorithms | Graph Traversals | Question 12

View Discussion
Improve Article
Save Article
  • Difficulty Level : Basic
  • Last Updated : 28 Jun, 2021

Is following statement true/false

If a DFS of a directed graph contains a back edge, any other DFS of the same graph will also contain at least one back edge.

(A) True
(B) False

Answer: (A)

Explanation: A back edge means a cycle in graph. So if there is a cycle, all DFS traversals would contain at least one back edge.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!