#19077: Greatly speed up equality check of equal graphs
-------------------------------------+-------------------------------------
Reporter: novoselt | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Andrey | Reviewers: Jori Mäntysalo,
Novoseltsev | Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/novoselt/graph_eq | 959c85d02f96b679a1bc082543359554d496eeb7
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Okayyyy. Thanks for the code! And if you ever see graph equality reaching
the top of the screen when you profile poset code, remember that some more
can be saved there.
Though of course, removing this 'UniqueRepresentation' inheritance would
mean that there is no need to call `Graph.__eq__` anymore when a poset is
created `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#comment:21>
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.
