#17781: No trivial way to find out if a digraph has (directed) cycles?
----------------------------+------------------------------------
Reporter: darij | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.5
Component: graph theory | Keywords: graphs, acyclic,
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
----------------------------+------------------------------------
I have a `DiGraph` and I want to know if it is acyclic. But I see no
simpler way than running `all_cycles_iterator().next()` and catching a
`StopIteration` exception. Am I being stupid or is this a usability
failure?
--
Ticket URL: <http://trac.sagemath.org/ticket/17781>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
