#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):
> You've changed the meaning: `labels=self._weighted and other._weighted`
is consistent with the documentation, while `labels=self._weighted` is
not.
I did that because it is tested several lines above that `self.weighted()
== other.weighted()`.
> Regarding the multi-edge check: what I have tried to do was avoiding
`sorted` since you have pointed out that labels may not be sortable. I
don't see any real alternative to doing what I've done then.
Oh. I see. Well, then if you want to compare lists like that, then it can
be done on the lists of labels directly, instead of the lists of all
edges.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19077#comment:14>
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.
