Doubt

Question

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

Is it correct ?

According to me its True because in standard algorithm we maintain a visited datastructure to keep track of which vertex is visited and we after then skip those vertex if found again hence one vertex will never get visited again isn't it?

Comments

I think ,because of backtracking it will visit more than once @rahul??

---

Yes srestha ,thats why i mentioned "Processing" not "visiting".This is made easy question.It sounds ambiguous to me.

---

According to me visited means exploring because it make sense right else in every algorithm like BFS and Dijkstrash every vertex will be visited more than once.Correct me if i am wrong