floyd


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

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

floyd 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 codes:

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.

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.

CODEPACK, a FORTRAN90 code which computes "codes" that can determine if two graphs are isomorphic.

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

floyd_test

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

GRAPH_REPRESENTATION, a data directory which contains examples of ways of representing abstract mathematical graphs

GRF, a data directory which contains a description of the GRF format and some examples.

GRF_IO, a FORTRAN90 code which reads and writes GRF files.

GRF_TO_EPS, a FORTRAN90 code which can make an encapsulated PostScript image of a GRF file.

SUBSET, a FORTRAN90 code which generates, ranks and unranks various combinatorial objects.

TABLE_GRAPH_CODE, a FORTRAN90 code which reads a TABLE file describing a graph, and computes its graph code.

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

Reference:

  1. Robert Floyd,
    Algorithm 97: Shortest Path,
    Communications of the ACM,
    Volume 5, Number 6, page 345, June 1962.
  2. Michael Quinn,
    Parallel codeming in C with MPI and OpenMP,
    McGraw-Hill, 2004,
    ISBN13: 978-0071232654,
    LC: QA76.73.C15.Q55.

Source Code:


Last revised on 05 March 2022.