#16005: Waste of time in iterator_edges 2
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.2
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Vincent Delecroix
theory | Work issues:
Keywords: | Commit:
Authors: | 98286f45fc077f9778708ca3f064a2f5a13853ad
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/16005 |
Dependencies: |
#15978 |
-------------------------+-------------------------------------------------
Changes (by vdelecroix):
* commit: 567600b943c81837a5bc525136b55c6f7878327b =>
98286f45fc077f9778708ca3f064a2f5a13853ad
* branch: u/ncohen/16005 => public/16005
Comment:
Hi Nathann,
I update the branch to sage.6.2.rc0 and implement what I said. There is
still one `sage_malloc` that can be avoided in
`out_neighbors_BTNode_unsafe` (it is documented in a `TODO` bloc). The
timings are a bit better with this new implementation. Please have a look.
Vincent
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=9623fd75605972cbc177193a16c81b64d9fc26fc
9623fd7]||{{{Merge branch 'u/ncohen/16005' of trac.sagemath.org:sage into
16005-waste_of_times_graph2}}}||
||[http://git.sagemath.org/sage.git/commit/?id=98286f45fc077f9778708ca3f064a2f5a13853ad
98286f4]||{{{optimization of edge_iteration in SparseGraphBackend +
documentation}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/16005#comment:9>
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/d/optout.
