Graph Algorithm 7

4Lt G be an undirected graph. Consider a depth first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?

Option : C
Explanation :
In DFS if ‘v’ is visited after ‘u’ then one of the following is true.
(i) if (u, v) is an edge

(ii) if ‘u’ is x leaf node

Forgot your password?

I agree with the Terms.