#11053: improving shortest path all pairs through BFS computations
------------------------------+---------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: closed
Priority: major | Milestone: sage-4.7.2
Component: graph theory | Resolution: fixed
Keywords: | Work_issues:
Upstream: N/A | Reviewer: Leonardo Sampaio
Author: Nathann Cohen | Merged: sage-4.7.2.alpha2
Dependencies: #10905 |
------------------------------+---------------------------------------------
Changes (by jdemeyer):
* status: positive_review => closed
* dependencies: => #10905
* resolution: => fixed
* merged: => sage-4.7.2.alpha2
Old description:
> After taking a look at the SparseGraph backend, it looks like some time
> is actually spent obtaining the list of neighbors. This patch caches so
> that the out_neighbors method does not have to be called so often.
>
> Requires : #10905
New description:
After taking a look at the SparseGraph backend, it looks like some time is
actually spent obtaining the list of neighbors. This patch caches so that
the out_neighbors method does not have to be called so often.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11053#comment:6>
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.
