Algorithms | Graph Traversals | Question 12
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.
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