Register

DFS tree

298 views
0 0 votes
Statement: DFS of an undirected graph contains tree edges and back edges but can never contain forward edges and cross ege. TRUE

if it is a undirected graph then there is no difference between forward and backward edges hence above statement should be false, but it is given true. please clear my doubts

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · generating functionNext → · AppliedAi MOCK1
← Previous in category · C PROGRAMNext in category → · Modification to GATE...
Position:
Show:

Related questions

5 5 votes
2 answers 2 answers
1.9k
1.9k views
dd asked Jan 13, 2017
1,897 views
Tree DFS
int func(Node root) { if(root == NULL) return 0; else if(root->left == NULL && root->right == NULL) return 2; else return(3 + func(root->left) + func(root->right)); }Abov...
7 7 votes
1 1 answer
307
307 views
GO Classes asked Jul 10
307 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack Implementation & DFS
Assume there are $n$ elements in the data structure. Consider the following statements:$\text{S1}:$ A stack can be implemented using a linked list such that each individu...
0 0 votes
0 0 answers
562
562 views
Balaji Jegan asked Oct 23, 2018
562 views
TANCET 2016 DFS
4 4 votes
1 1 answer
1.3k
1.3k views
budhu asked Jan 25, 2018
1,273 views
DFS- depth first search