#8714: add Bellman-Ford algorithm for shortest paths
-------------------------+-------------------------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: | Status: positive_review
enhancement | Milestone: sage-duplicate/invalid/wontfix
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers: David Coudert
Keywords: | Work issues:
Authors: David | Commit:
Coudert | 2c58a9bcdeab06355c52912c12d041ea143eed43
Report Upstream: N/A | Stopgaps:
Branch: |
u/cheuberg/8714 |
Dependencies: |
#12806 |
-------------------------+-------------------------------------------------
Changes (by dcoudert):
* status: needs_review => positive_review
* reviewer: => David Coudert
Comment:
Actually I tried this patch a few days ago and I fully agree that it has
to be fully rewritten. Moreover, to be competitive with respect to #18931,
the algorithm has to be cythonized.
So let's close this ticket, and if later we decide to give a try to a
fresh cython implementation, we can do it in another ticket.
Best,
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/8714#comment:33>
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.
