#8714: add Bellman-Ford algorithm for shortest paths
--------------------------------+-------------------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.1
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #12806 | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by ncohen):
Well, it depends on whether you want to optimize it in C a bit or not.. In
this case the choice is made for you as you would need a Cython file.
You could also use the "distance_all_pairs" file.
I would say that the best name would be.... no name ? A hidden function.
Then function would then be accessed through the usual methods of
graphs/digraphs, like "distance", "shortest path", "distances all pairs",
with a special flag or just automatically if there happen to be negative
weights on the edges... What do you think ? It would be weird to create a
new function for that if we have many already, especially if you wonder
what it should return -- in this case it would have to return what the
function calling it expects...
We should be able to talk about in in a few days `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8714#comment:6>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
