#14535: Mutability of Graphs
--------------------------------------------+-------------------------------
Reporter: SimonKing | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: mutability graph | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Simon King, Volker Braun | Merged in:
Dependencies: #14524 | Stopgaps:
--------------------------------------------+-------------------------------
Comment (by ncohen):
Why don't you implement these immutable graph with a boolean value in the
sage/graphs/base/ files ? I have nothing against a cdef boolean value that
would be checked when add_edge/vertex methods are called (even though I
think that the only good way to implement this is to write another backend
for immutable graphs. But I can do that later, I don't mind), but I do
have something against any unnecessary loss of performances in these
classes, and especially in these functions.
I exchange many emails these days about how these base classes should be
reimplemented efficiently, and if on the other hand you just come and add
10% there or there, we're just wasting our time.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14535#comment:27>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
