#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: | 536c4817a1a8521c49255b75c6a6b475d10e38d2
u/novoselt/graph_eq | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
You build a list of booleans that you do not need ... And if you use
iterators, you will build an iterator that you do not need either.
Technically (though you did not introduce it) comparing labels by sorting
lists if wrong, as you cannot suppose that the labels are TOTALLY ordered.
Should be a set comparison instead.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#comment:9>
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.
