MadeEasy Test Series: Programming & DS - Graphs

Question

In DFS traversal every vertex of the graph is visited exactly once. True / False?

Comments

Yes it is False.

In case of recursive DFS node is push onto stack exactly once.

But in Iterative DFS it might get push onto the stack more than once.

source : https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search

Answer 1

TRUE??

Comments

Given answer is false

Answer 2

definite it false.....becoz

when we visit vertex first time we pushed it in to stack and go right,,,,let right child is null then again root vertex is popped and checked for left.......

we can say that no. of times a vertex is visited could be equal to the no. child of a vertex...

Comments

@hs_yadav

number of child + 1  ?