#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 | Merged in:
Dependencies: #14524 | Stopgaps:
------------------------------------+---------------------------------------
Comment (by ncohen):
> Should named graphs be immutable?
Hmmmmmm `:-/` I see the points (we could cache nice information inside of
them which is hard to compute), but I don't like it much `:-/` We already
had some problems with the class `BipartiteGraph` which constrained some
operations (you were not able to add an edge between two vertices of the
same class, for instance). The `CompleteBipartiteGraph` and
`RandomBipartiteGraph` were automatically `BipartiteGraph` instances, and
it really was a mess. Because you could not expect a function thought for
regular graphs to work well on such instances, and the only way out was to
make copies of these input again and again into normal graphs, then work
on them... `:-/`
Then again, perhaps you are right and I just complain because I am used to
the old way... `:-/`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14535#comment:21>
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.
