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
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
