bellman_ford_test, a FORTRAN90 code which calls bellman_ford(), 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.
The computer code and data files described and made available on this web page are distributed under the MIT license
bellman_ford, a FORTRAN90 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.