jburkardt

TOMS097\ All Pairs Shortest Distance, Floyd’s Algorithm. {#toms097-all-pairs-shortest-distance-floyds-algorithm. align=”center”} ===============================================

---

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

Licensing: {#licensing align=”center”}

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

Languages: {#languages align=”center”}

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

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

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.

Reference: {#reference align=”center”}

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

Source Code: {#source-code align=”center”}

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

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

• toms097_prb.cpp, a sample calling program.
• toms097_prb_output.txt, the output file.

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

• I4MAT_SHORTEST_PATH computes the shortest distance between all pairs of points.
• R8MAT_SHORTEST_PATH computes the shortest distance between all pairs of points.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

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

---

Last revised on 01 March 2014.