Register

Doubt

565 views
0 votes
0 votes
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?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Hirak asked Jun 2, 2019
1,218 views
Self Doubt:Infinite loop
#include<iostream> using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); } For this above code the output is only upto → 64891.Hello Does this mean that that the stack can hold only 64891 recursive calls? (I am using dev c++)
#include<iostream using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); }For this above code the output is only upto → 6489...
User Avatar
0 votes
0 votes
1 answer
2
Raj Kumar 7 asked Jul 22, 2018
658 views
self doubt
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list : i think answer is O(1). Am i right?
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list :i think answer is O(1).Am i right?
User Avatar
0 votes
0 votes
0 answers
3
Raj Kumar 7 asked Jul 17, 2018
626 views
self doubt
The number of different directed trees with 3 nodes are A) 3 B) 4 C) 5 D) 6 I think the answer is 5 but the answer is not.
The number of different directed trees with 3 nodes areA) 3B) 4C) 5D) 6I think the answer is 5 but the answer is not.
User Avatar
0 votes
0 votes
2 answers
4
vijju532 asked Jul 5, 2018
729 views
self doubt
i am getting 4,3,4,3,8,2 is it right?????
i am getting 4,3,4,3,8,2 is it right?????
User Avatar
Link Copied!