Its a slow algo for finding cycles in a linked list, the previous one is faster.

On 5/15/06, Kapil <[EMAIL PROTECTED] > wrote:

try Breadth First Search, and if in between u find that some node you
have traversed then yes there is a cycle.






--~--~---------~--~----~------------~-------~--~----~
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