floyd


floyd, a FORTRAN77 code which demonstrates 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 an Octave version and a Python version.

Related Data and Programs:

floyd_test

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

cities, a FORTRAN90 library 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 library which computes "codes" that can determine if two graphs are isomorphic.

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

grafpack, a FORTRAN90 library 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 library which reads and writes GRF files.

grf_to_eps, a FORTRAN90 library which can make an encapsulated PostScript image of a GRF file.

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

Reference:

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

Source Code:


Last revised on 05 October 2023.