You can use a DFS.

Greetings.

On 10/22/06, malli <[EMAIL PROTECTED]> wrote:

Hello All.

How can I detect all loops in a directed graph?
I would like to detect the starting node of the loop as well as the
closing
edge of the loop.


Thanks in Advance.

Regards,
Mallikarjun.







--
Jair Cazarin Villanueva
http://slipvayne.googlepages.com
--~--~---------~--~----~------------~-------~--~----~
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-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to