#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: | 6e83ae06e04597ddcf92cd981f4f690c4b57deef
u/novoselt/graph_eq | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Speedup confirmed. After `P7 = Posets(7).list()` the command
`P=Posets.ChainPoset(7)` took about 635 microseconds, after this patch it
takes about 540 microseconds. I ran the test on i5-3470 @ 3.20GHz.
You can mark this as positive_review. Or if you want, check my comment
above.
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#comment:5>
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.
