#17225: Degrees of looped *immutable* graphs are wrong
-------------------------+-------------------------------------------------
Reporter: | Owner:
kcrisman | Status: needs_review
Type: | Milestone: sage-6.4
defect | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | 58cf24722664d1b299ab4de934455579125e3326
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/17225 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by kcrisman):
> Yesyes I understand. Well, I was rather happy to find a way to fix that
without changing the internal data structure. I really did not want to add
an "if" there, in a function that was just a substraction `:-)`
>
> The only difference will be at Python level, so it does not matter much.
Hmm, I see what you mean though, keeping track of all this extra data
could be expensive when people are searching through really large sets of
relatively large graphs (which is when this was implemented in the first
place). I wonder if that will impact efficiency or speed.
--
Ticket URL: <http://trac.sagemath.org/ticket/17225#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.