TOMS097
All Pairs Shortest Distance, Floyd's Algorithm.

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

Licensing:

The computer code and data files made available on this web page are distributed under the GNU LGPL 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 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.

DIJKSTRA, a Python program 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:

• i4mat_print.py, prints an I4MAT.
• i4mat_print_some.py, prints some of an I4MAT.
• i4mat_shortest_path.py computes the shortest distance between all pairs of points.
• r8mat_print.py, prints an R8MAT.
• r8mat_print_some.py, prints some of an R8MAT.
• r8mat_shortest_path.py computes the shortest distance between all pairs of points.
• timestamp.m prints the current YMDHMS date as a time stamp.

Examples and Tests:

• toms097_test.py, calls all the tests.
• toms097_test.sh, runs all the tests.
• toms097_test.txt, the output file.

You can go up one level to the Python source codes.