Q. 23 Suppose depth first search is executed on the graph below starting at some
unknown vertex. Assume that a recursive call to visit a vertex is made only after
first checking that the vertex has not been visited earlier. Then the maximum
possible recursion depth (including the initial call) is _______.
(A) 17
(B) 18
(C) 19
(D) 20
Answer: (C)
Explanation:
