#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):
You need a coffee ;-)
> I really do not think it makes any difference, but I did it anyway `:-P`
>
> > * is_transitive": something is missing in the for loops since you
always test the first n values of the distances array. May be a
c_distances = c_distances+n?
>
> Oh my GOD `O_O;;;`
Well, now there is a # in front of c_distances += n, so no difference.
> > Last, you could remove empty lines after """.
>
> I only found an empty line in the last method of comparability.pyx, if
that is what you had in mind I removed it.
check in digraph.py, function is_transitive
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12874#comment:15>
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.
