#15278: Hash and equality for graphs
--------------------------------+-------------------------
Reporter: SimonKing | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.13
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+-------------------------
Comment (by SimonKing):
Shouldn't the hash of graphs be cached, for efficiency? Currently it does
`return hash((tuple(self.vertices()), tuple(self.edges())))`, which seems
rather expensive.
Note that #12601 makes it possible to comfortably turn the hash (and other
special methods) into a cached method.
--
Ticket URL: <http://trac.sagemath.org/ticket/15278#comment:1>
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/groups/opt_out.
