Search Interview Questions |  More than 3000 questions in repository. There are more than 900 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know. |
|
|||
|
| ||||
| Interview Questions and Answers | ||||
| ||||
| Ans. In Breadth first algorithm, all the adjacent nodes of the starting node is visited first and then the same rule is followed while moving inwards whereas In Depth first algorithm, all the nodes of a single traversal path are visited first till a cycle or an end is found. For example , given the following entries of adjacent nodes 1,2 1,3 1,6 2,4 2,5 3,6 The Breadth first path would be 1,2,3,6,4,5 and Depth first path would be 1,2,4,5,3,6 | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
 Discuss Correct / Improve  graph traversal breadth first vs depth first  frequent | ||||
 Related Questions | ||||
 Write an Algorithm for Graph Traversal ? The Graph has a loop. | ||||
| Given the list of adjacent nodes, What will be the Breadth First path 1 -> 2 1 -> 3 1 -> 6 2 -> 4 3 -> 5 | ||||
| Given the list of adjacent nodes, What will be the Depth First path 1 -> 2 1 -> 3 1 -> 6 2 -> 4 3 -> 5 | ||||
| What will happen in a graph traversal if we don't have a check for cycle | ||||
