edited by
832 views
0 votes
0 votes
In DFS traversal every vertex of the graph is visited exactly once. True / False?
edited by

2 Answers

0 votes
0 votes

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

Related questions

6 votes
6 votes
3 answers
1
rahul sharma 5 asked Dec 9, 2017
3,798 views
Consider the following graph:The minimum size of queue required when performing BFS on above graph is ________.(Size of queue is represented by maximum number of element ...
1 votes
1 votes
0 answers
2
1 votes
1 votes
0 answers
4