FLOYD
Shortest Distances Between Nodes in a Directed Graph


FLOYD is a MATLAB library 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.

Related Data and Programs:

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

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

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

FLOYD is available in a C++ version and a FORTRAN90 version and a MATLAB version.

GRAFPACK is a FORTRAN90 library which computes various quantities associated with mathematical graphs.

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

GRF_IO is a FORTRAN90 library which reads and writes GRF files.

GRF_TO_EPS is a FORTRAN90 library which can make an encapsulated PostScript image of a GRF file.

SUBSET is a MATLAB library which generates, ranks and unranks various combinatorial objects.

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

XGED is a C program which can edit graphs visually; it uses the X Window library to display the graph, and to detect the user's input.

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:

Examples and Tests:

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


Last revised on 17 May 2009.