Suppose depth first search is executed on the graph below starting at some…

PYQ GATE 2014

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

Attempted by 197 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…