**bellman_ford_test**,
a C++ program which
calls bellman_ford() to
implement 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.

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

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.

- bellman_ford_test.cpp, a sample calling program.
- bellman_ford_test.sh, runs all the tests.
- bellman_ford_test.txt, the output file.