#15278: Hash and equality for graphs
-------------------------------------+-------------------------------------
Reporter: SimonKing | Owner:
Type: defect | Status: positive_review
Priority: major | Milestone: sage-6.1
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Simon King | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/SimonKing/ticket/15278 | 2525d22a6b3a687bf932c2afaa8297e40c7af3d8
Dependencies: #12601, #15491 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Replying to [comment:82 ncohen]:
> Well. What's the difference with implementing it in the ticket that will
use it as the default backend for posets ? Nobody will use it in the
meantime, and if you want to get technical it's not related to "hash and
equality for graphs" either.
Good point. But I think it isn't in the "poset" ticket either". Would you
mind if I created a new ticket "pickling of immutable graphs", that will
end up to be a dependency for the poset ticket?
--
Ticket URL: <http://trac.sagemath.org/ticket/15278#comment:83>
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.
