#18931: Boost shortest paths
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Boost, shortest | Merged in:
paths, Bellman-Ford, Johnson | Reviewers: David Coudert
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | d06c815c2fdc4cf80c39ca16a3a979337a9e4e2b
u/borassi/boost_shortest_paths | Stopgaps:
Dependencies: #18910, #18938 |
-------------------------------------+-------------------------------------
Changes (by dcoudert):
* status: needs_review => positive_review
* reviewer: => David Coudert
Comment:
Hello,
I don't know how is implemented the `Bellman-Ford_Boost`, but the
implementation I proposed in #8714 is quite smart since the running time
is in between `O(n+m)` and `O(n^2)`, depending on the weights. Anyway, now
that you have improved and cleaned many parts, I will be able to compare
#8714 and see if it is interesting to finalize it or not.
This is really big patch. It passes all tests and the doc builds properly
and looks good.
I don't have comments anymore and so Iset the ticket to positive review.
Best,
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/18931#comment:15>
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.
