#18931: Boost shortest paths
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Boost, shortest | Merged in:
paths, Bellman-Ford, Johnson | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | fe1b51538bb57ea77793eab5f2d0a7e2800f8192
u/borassi/boost_shortest_paths | Stopgaps:
Dependencies: #18910, #18938 |
-------------------------------------+-------------------------------------
Changes (by git):
* commit: 8c72720d5f32799b2a54678ed5613e31f3858a12 =>
fe1b51538bb57ea77793eab5f2d0a7e2800f8192
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=fe1b51538bb57ea77793eab5f2d0a7e2800f8192
fe1b515]||{{{Corrected a bug / added example for Dijkstra with negative
weights}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/18931#comment:11>
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.
