Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Cycle in Directed Graph

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

in reply to Cycle in Directed Graph

How about Graph?

Relevant parts from the document -

has_a_cycle $g->has_a_cycle Returns true if the graph has a cycle, false if not. find_a_cycle $g->find_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.

Update: I am looking for cycles in this graph

      I hope you are not trying to find out "all" cycles in the graph which is NP-complete.

Replies are listed 'Best First'.
Re^2: Cycle in Directed Graph
by cbrandtbuffalo (Deacon) on Sep 21, 2005 at 17:56 UTC
    In my experience with the Graph module in one script, the first cycle it found was always the same one. It was correct, but I couldn't get it to find other cycles unless I removed that one. If you just want one cycle, you should be OK.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://493637]
Eily the verb from this sentence
[LanX]: jdporter adjusted the best nodes algorithm not long ago to public demands, my theory more complicated= more error prone
[Eily]: what error? I see no issue :P
LanX and: = harder to reproduce. ..
[LanX]: sorry, i didn't break math yet, but it's top priority on my todo list

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (10)
As of 2018-03-20 10:20 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (249 votes). Check out past polls.