toms097, a FORTRAN90 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: or NETLIB:


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


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

Related Data and Programs:

CITIES, a FORTRAN90 code which handles various problems associated with a set of "cities" on a map.

CITIES, a dataset directory which contains a number of city distance datasets.

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

FLOYD, a FORTRAN90 code which implements Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.

GRAFPACK, a FORTRAN90 code which computes various quantities associated with mathematical graphs.



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

Source Code:

Last revised on 12 March 2021.