Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Cycle in Directed Graph

by sk (Curate)
on Sep 21, 2005 at 01:22 UTC ( #493637=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    has_a_cycle
    
    ...
        Returns a cycle if the graph has one (as a list of vertices), an e
    +mpty list if no cycle can be found.
    
        Note that this just returns the vertices of a cycle: not any parti
    +cular cycle, just the first one it finds. A repeated call might find 
    +the same cycle, or it might find a different one, and you cannot call
    + this repeatedly to find all the cycles.
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://493637]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2016-12-03 11:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (55 votes). Check out past polls.