If the DFS finishing time f[u] > f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth-first tree.
(A)
True
(B)
False
Answer: (B)
Explanation:
In a graph with three nodes, r u, and v, with edges (r; u) and (r; v), and r is the starting point for the DFS, u and v are siblings in the DFS tree, neither as the ancestor of the other.
Hence the above statement si false.
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!
… [Trackback]
[…] Read More Information here to that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-12/ […]
… [Trackback]
[…] Here you can find 3824 more Information on that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-12/ […]
… [Trackback]
[…] There you can find 88663 more Information on that Topic: geeksforgeeks.org/algorithms-graph-traversals-question-12/ […]