#18931: Boost shortest paths
-------------------------------------------------+-------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Boost, shortest paths, | Merged in:
Bellman-Ford, Johnson | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Changes (by {'newvalue': u'Michele Borassi', 'oldvalue': ''}):
* keywords: => Boost, shortest paths, Bellman-Ford, Johnson
* component: PLEASE CHANGE => graph theory
* type: PLEASE CHANGE => enhancement
* author: => Michele Borassi
Old description:
New description:
Use Boost algorithms to compute shortest paths in graphs with negative
weights. To compute all shortest paths from a given vertex v, we use
Bellman-Ford algorithm, while to compute the shortest path between each
pair of vertices we use Johnson algorithm.
The complexity of both algorithms is quadratic (apart from logarithmic
factors): hence, the graph conversion overhead is negligible.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/18931#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 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.
