Graph Algorithm 15

0. 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.

Answer
Comment
Array

Option : A
Explanation :

Maximum DFS recurside depth is 19
A → B → C → D → E → F → G → H → I → J → K
→ L → M → N → O → P → Q → R → S

Forgot your password?

I agree with the Terms.