Open In App

Algorithms | Graph Traversals | Question 12

Like Article
Like
Save
Share
Report

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
Please comment below if you find anything wrong in the above post


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads