#19077: Greatly speed up equality check of equal graphs
-------------------------------------+-------------------------------------
Reporter: novoselt | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Andrey | Reviewers: Jori Mäntysalo
Novoseltsev | Work issues:
Report Upstream: N/A | Commit:
Branch: | f2a826c5f5b28ab793d1eb750a87d91f9bafbb96
u/novoselt/graph_eq | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by novoselt):
I've started writing it down, but can't help liking my last variant more
as it is shorter and cleaner. What exactly is gained if we do the same
thing for the list of labels of each edge? It seems to me that only some
memory efficiency since the list of edges will not be created all at once.
But given that we already have graphs in place, it does not seem like a
total waste of memory.
So I propose merging the current brunch as an improvement over what used
to be.
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#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 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.
