#9741: Sorting vertices of a graph
-----------------------------+----------------------------------------------
Reporter: rbeezer | Owner: jason, ncohen, rlm
Type: enhancement | Status: closed
Priority: minor | Milestone: sage-4.6
Component: graph theory | Resolution: fixed
Keywords: | Author: Rob Beezer
Upstream: N/A | Reviewer: Nathann Cohen
Merged: sage-4.6.alpha1 | Work_issues:
-----------------------------+----------------------------------------------
Comment(by mpatel):
Replying to [comment:13 rbeezer]:
> Did something change elsewhere? This was passing tests before.
Ticket #4000 implements fast polynomial arithmetic over the rationals via
FLINT1. It removes the class `Polynomial_rational_dense` but "replaces"
it with `Polynomial_rational_flint`.
Would `dsc = lambda x: x.discriminant()` work in the sorting test? If it
does, it could shield the test against changes to a lower-level API.
> I could change this to something different. I'm traveling with family
right now, but could work on it tomorrow night. How urgent is a fix?
It's not very urgent, though we're hoping to merge #4000 in 4.6.alpha2,
which I plan to release at least a week from now (alpha1 is not yet out).
Currently, however, there's a more serious build error at #4000.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9741#comment:14>
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.
