#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: Simon King | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/SimonKing/ticket/15278 | c774057bf07b2da8539f2395555b2062428874f4
Dependencies: #12601 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Replying to [comment:16 ncohen]:
> Nope. `multiple_edges` and `loops` will give you the list of multiple
edges and loops, and that cannot change if the adjacencies do not change,
so that's ok. Aaaaand the same goes with the number of vertices and edges,
so you're fine !
Honorary!
> While saying each time that the labels *CAN* change if they are lists
and that the users append/remove things from them. But indeed `:-P`
While replying each time that I consider this a misuse, and if a user
mutates labels manually (without using "official" methods) then (s)he
should be ready to bear the consequences. So, I don't care about mutable
labels `:-P`
--
Ticket URL: <http://trac.sagemath.org/ticket/15278#comment:17>
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.
