TOMS097
All Pairs Shortest Distance, Floyd's Algorithm.


TOMS097, a C++ 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: http://calgo.acm.org/ or NETLIB: http://www.netlib.org/toms/index.html.

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:

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

DIJKSTRA, a C++ program which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

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

toms097_test

Reference:

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

Source Code:


Last revised on 01 May 2020.