#13730: Speed up some graph iterations
--------------------------------+-------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by vdelecroix):
Hi,
I appologize, I was a bit old school in my precedent message.
A long time ago, Cython did not support the yield statement and it was
necessary either to write a class dedicated to iteration or to build the
set on which we would like to iterate and return `iter(my_set)`. This is
the reason why it is implemented like that in `sage.graphs.base.c_graph`
and `sage.graphs.base.sparse_graph`.
I upload a patch where all iterators does not build the underlying set.
The gain is not extraordinary (only a x2) and the output order is
completely messed up (this need to be fixed).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13730#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.
