Register

depth first traversal

1,243 views
0 votes
0 votes

User Avatar

1 Answer

3 votes
3 votes

If there are  n leave nodes ===> you should  at least (n-1) back tracks.. .

Here there are 2 leave nodes ===> you should need atleast 1 back track. but with 1 backtracks you can't  cover all nodes. With 2 backtracks  we can cover all nodes. .. Therefore  we need two backtracks. 

A-B-E-C-F-D-backtrack-F-I-backtrack-G-H

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Sanjay Sharma asked Jul 2, 2016
999 views
The Depth First and Breadth First Traversal algorithms visit the nodes
The Depth First and Breadth First Traversal algorithms visit the nodes in exactly the same order in which the following types of graphs Binary tree Linear chain Complete graph None of the above
The Depth First and Breadth First Traversal algorithms visit the nodes in exactly the same order in which the following types of graphsBinary treeLinear chainComplete gra...
User Avatar
3 votes
3 votes
2 answers
2
suchismith roy asked May 27, 2016
2,102 views
Difference between Depth first traversal and Depth first search
DFS is done for a graph.So we need a visited array to keep track of cycles.Do we need visited array for DFT of a tree? What is the basic difference between traversal and search ?
DFS is done for a graph.So we need a visited array to keep track of cycles.Do we need visited array for DFT of a tree?What is the basic difference between traversal and s...
User Avatar
1 votes
1 votes
0 answers
3
pradeepchaudhary asked Dec 8, 2018
313 views
Depth First Search: Finding if The graph is connected
Better Explanation??
Better Explanation??
User Avatar
3 votes
3 votes
0 answers
4
Na462 asked Aug 21, 2018
1,306 views
Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack s...
User Avatar
Link Copied!