jburkardt

FLOYD\ Shortest Distances Between Nodes in a Directed Graph {#floyd-shortest-distances-between-nodes-in-a-directed-graph align=”center”} ====================================================

---

FLOYD is a C++ library which demonstrates Floyd’s algorithm for finding the shortest distance between every pair of nodes in a directed graph.

Licensing: {#licensing align=”center”}

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

Languages: {#languages align=”center”}

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

Related Data and Programs: {#related-data-and-programs align=”center”}

BELLMAN_FORD, a C++ 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 C++ 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

SUBSET, a C++ library which generates, ranks and unranks various combinatorial objects.

TOMS097, a C++ library which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd’s algorithm.

Reference: {#reference align=”center”}

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: {#source-code align=”center”}

• floyd.cpp, the source code.
• floyd.hpp, the include file.

Examples and Tests: {#examples-and-tests align=”center”}

• floyd_prb.cpp, a sample calling program.
• floyd_prb_output.txt, the output file.

List of Routines: {#list-of-routines align=”center”}

• I4_HUGE returns a “huge” I4.
• I4_MAX returns the maximum of two I4’s.
• I4_MIN returns the minimum of two I4’s.
• I4MAT_FLOYD finds the shortest I4 distances between pairs of nodes in a directed graph.
• I4MAT_PRINT prints an I4MAT, with an optional title.
• I4MAT_PRINT_SOME prints some of an I4MAT.
• R8_HUGE returns a “huge” R8.
• R8_MIN returns the minimum of two R8’s.
• R8MAT_FLOYD finds the shortest R8 distances between pairs of nodes in a directed graph.
• R8MAT_PRINT prints an R8MAT, with an optional title.
• R8MAT_PRINT_SOME prints some of an R8MAT.
• S_LEN_TRIM returns the length of a string to the last nonblank.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C++ source codes.

---

Last revised on 27 November 2008.