What will happen in a graph traversal if we don't have a check for cycle

Javasearch.buggybread.com

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.

Submit Question

Interview Questions and Answers

Q1. What will happen in a graph traversal if we don't have a check for cycle

Ans. It will result in never ending loop

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve graph traversal}

Related Questions

What is the difference between Graph's Breadth first and Depth First algorithm ?

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