#8714: add Bellman-Ford algorithm for shortest paths
---------------------------------+----------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.13
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: David Coudert | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #12806 | Stopgaps:
---------------------------------+----------------------------------
Comment (by dcoudert):
Hello,
I haven't received notification for the addon patch.
The addon patch is ok (install, test, etc.).
Thank you for this improvement. I let you decide for the status of the
patch.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/8714#comment:17>
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/groups/opt_out.
