#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:
--------------------------------+-------------------------------------------
Changes (by dcoudert):
* cc: ncohen (added)
Comment:
I have a better implementation, but I don't know exactly
- Where to place it: generic_graph.py or generic_graph_pyx.pyx for more
efficiency
- The best name: shortest_paths_BellmanFord ?
- What to return: dictionary with distances and dictionary with
predecessors or paths?
Well, some minor details ;-)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8714#comment:5>
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.
