#8458: iterator for graphs() doesn't return independent graphs
----------------------------+-----------------------------------------------
Reporter: mvngu | Owner: rlm
Type: defect | Status: new
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by rlm):
This is an unintended consequence of the fact that when the `graphs(n)`
iterator yields a graph, it does not first make a copy. The method of
generating graphs is to add on to previously generated graphs in a well-
chosen way, and I did not think to make a copy of the graph before having
the iterator yield it.
This shouldn't just be documented, but in fact I think this should be an
option to `graphs(n)`. If someone will not modify the graphs in the loop,
they can get the speed advantage of not making copies, and someone else
who wants to modify them can have the iterator make copies on the fly.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8458#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
