jburkardt

BELLMAN_FORD\ All-to-One Shortest Distances on Directed Graph {#bellman_ford-all-to-one-shortest-distances-on-directed-graph align=”center”} ===============================================


BELLMAN_FORD, a C++ library which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.

Licensing: {#licensing align=”center”}

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages: {#languages align=”center”}

BELLMAN_FORD is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version and a Python version.

DIJKSTRA, a C++ library which implements a simple version of Dijkstra’s minimum distance algorithm for graphs.

FLOYD, a C++ library which implements Floyd’s algorithm for finding the shortest distance between pairs of nodes on a directed graph.

TOMS097, a C++ library which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd’s algorithm.

Reference: {#reference align=”center”}

  1. Richard Bellman,\ On a routing problem,\ Quarterly of Applied Mathematics,\ Volume 16, 1958, pages 87-90.
  2. Lester Ford,\ Network Flow Theory,\ RAND Corporation Paper P-923, 1956.

Source Code: {#source-code align=”center”}

Examples and Tests: {#examples-and-tests align=”center”}

List of Routines: {#list-of-routines align=”center”}

You can go up one level to the C++ source codes.


Last revised on 12 November 2014.