#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 ncohen):
> The new version goes through edges of self and throws away edges of
other. Since edges have some canonical order, I assume that it should be
relatively fast (i.e. we usually will remove the first element) and
technically should work for all cases, but the original change avoids
creating lists of edges.
I have to say that I do not like this `list.remove` thing at all. I added
a commit at `public/19077`, what do you think?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#comment:12>
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.
