#17707: Test if a graph is asteroidal triple free
-------------------------+-------------------------------------------------
Reporter: | Owner:
dcoudert | Status: needs_review
Type: | Milestone: sage-6.5
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: David | 9c9639a31f9cc0bf60626a30691ff99d41faa7c5
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17707 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by dcoudert):
* status: needs_info => needs_review
Comment:
Hello,
I have integrated all your remarks.
Question: what should we do if the input graph is not connected? test all
its connected components or raise a "notion defined for connected graph
only" error?
David.
PS: I had to do a distclean and to recompile everything (14hours). I don't
know what happens, but something was broken...
--
Ticket URL: <http://trac.sagemath.org/ticket/17707#comment:7>
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.
