Why is depth first search prefered over breadth first search to check for cycles in a graph?

Asked Sep 21 '13 at 11:38

Active Sep 21 '13 at 11:38

Viewed 439 times

Why is depth first search preferred over breadth first search to check for cycles in a graph?

asked Sep 21 '13 at 11:38

piyukr

3

There is a good answer for this question on Stackoverflow [here][1]. [1]: http://stackoverflow.com/questions/2869647/why-dfs-and-not-bfs-for-finding-cycle-in-graphs – sekky Sep 21 '13 at 11:42

0 Answers0