Opened 10 years ago
Last modified 10 years ago
#10432 closed enhancement
is_directed_acyclic is Cython (--> without NetworX) and its certificates — at Initial Version
| Reported by: | ncohen | Owned by: | jason, ncohen, rlm |
|---|---|---|---|
| Priority: | major | Milestone: | sage-4.6.2 |
| Component: | graph theory | Keywords: | |
| Cc: | mvngu | Merged in: | |
| Authors: | Nathann Cohen | Reviewers: | |
| Report Upstream: | N/A | Work issues: | |
| Branch: | Commit: | ||
| Dependencies: | Stopgaps: |
Status badges
Description
This patch contains an Cython implementation of a method testing whether a given digraph is acyclic. If it is, the method returns a topological sort, and returns a circuit otherwise. The method is then called through current Sage methods which relied on NetworkX
Nathann
Note: See
TracTickets for help on using
tickets.
