#7540: Speed up shortest_path_all_pairs() and update distance_graph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Comment(by ylchapuy):
then... use networkx. More precisely,
`networkx.all_pairs_shortest_path` and
`networkx.all_pairs_shortest_path_length`.
They are not based on Floyd-Marshall (it is also in networkx but way
slower)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7540#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.
