bellman_ford_test

bellman_ford_test, an Octave code 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.

Licensing:

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

Related Data and Programs:

bellman_ford, an Octave code 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.

Source Code:

• bellman_ford_test.m, a sample calling program.
• bellman_ford_test.sh, runs all the tests.
• bellman_ford_test.txt, the output file.
• bellman_ford_test01.m, solves a small problem with 6 nodes and 10 edges.