#12874: Recognition of Comparability graphs and Permutation graphs
----------------------------------+-----------------------------------------
Reporter: ncohen | Owner: tbd
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.1
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: David Coudert
Authors: Nathann Cohen | Merged in:
Dependencies: #12816, #12872 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by dcoudert):
Sorry about that.
In function is_comparability, you have:
{{{
EXAMPLE::
}}}
I suppose you can remove one :
In function is_permutation, you have:
{{{
... break
Then with MILP::
Trying random permutations, first with the greedy algorithm::
sage: from sage.graphs.comparability import is_permutation
}}}
Removing "Trying random permutations, first with the greedy algorithm::"
solves the docbuild problem.
Apparently, indentation can also be improved in many places in the file,
but I don't know how critical are the spaces before the ``sage: blah`` in
examples and tests.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12874#comment:9>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
