toms097

toms097, a Python code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.

The text of many ACM TOMS algorithms is available online through ACM: https://calgo.acm.org/ or NETLIB: https://www.netlib.org/toms/index.html.

Licensing:

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

Languages:

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

Related Data and Programs:

bellman_ford, a Python 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.

dijkstra, a Python code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

Reference:

1. Robert Floyd,
   Algorithm 97: Shortest Path,
   Communications of the ACM,
   Volume 5, Number 6, page 345, June 1962.

Source Code:

• toms097.py, the source code.
• toms097.sh, runs all the tests.
• toms097.txt, the output file.