The Bellman-Ford algorithm computes single-source shortest paths in a
weighted digraph (where some of the edge weights may be negative). Dijkstra’s
algorithm accomplishes the same problem with a lower running time, but
requires edge weights to be non-negative. Thus, Bellman-Ford is usually used
only when there are negative edge weights (from the
This Implementation is only a stub. For the moment only attributes located on
the edges are supported. If you need more features, consider using the
Dijkstra implementation. If you really need that algorithm, please contact
the team members through the mailing list.
Bellman, Richard “On a routing problem”, Quarterly of Applied Mathematics 16: 87–90. 1958.
O(VxE) time, where V and E are the number of vertices and edges respectively.