I think the DFS is much better in finding a cycle in a graph.


On 4/17/06, vim <[EMAIL PROTECTED]> wrote:

Hello guys
Which is faster in finding a graph cyclic or not ?
DFS OR BFS



--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to