#15978: Waste of time in g.edges() (acually in iterator_edges)
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_work
Type: | Milestone: sage-6.2
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Jernej Azarija
theory | Work issues:
Keywords: | Commit:
Authors: | 83f22e77e04b47fba65ae55adb4d80ec1c7d0a5e
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/15978 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
{{{
sage: Tab = CrystalOfTableaux(['A', 3], shape = [2,1,1])
sage: g=Tab.digraph()
sage: u,v = g.vertices()[:2]
sage: u <= v
...
RuntimeError: maximum recursion depth exceeded in cmp
}}}
What the hell can I do with that ?
Before, the following code was called :
{{{
sage: cmp(u,v)
-1
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/15978#comment:22>
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.
