#8714: add Bellman-Ford algorithm for shortest paths
-------------------------+-------------------------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: | Status: needs_review
enhancement | Milestone: sage-duplicate/invalid/wontfix
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers:
Keywords: | Work issues:
Authors: David | Commit:
Coudert | 2c58a9bcdeab06355c52912c12d041ea143eed43
Report Upstream: N/A | Stopgaps:
Branch: |
u/cheuberg/8714 |
Dependencies: |
#12806 |
-------------------------+-------------------------------------------------
Changes (by cheuberg):
* status: needs_info => needs_review
* milestone: sage-6.4 => sage-duplicate/invalid/wontfix
Comment:
Bellman-Ford has now been implemented in #18931. As discussed in
[http://trac.sagemath.org/ticket/18931#comment:15 #18931 comment 15], the
performance has not yet been compared with the code here.
However, the branch attached to this ticket no longer merges with develop
and very much work would be needed. Moreover, this ticket has not had any
activity for 15 months. My suggestion is to close this ticket here as a
duplicate.
--
Ticket URL: <http://trac.sagemath.org/ticket/8714#comment:32>
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.
