**floyd_test**,
a MATLAB code which
calls floyd(), which
demonstrates Floyd's algorithm for finding the shortest distance
between every pair of nodes in a directed graph.

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

floyd, a MATLAB code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.

- floyd_test.m, calls all the tests.
- floyd_test.sh, runs all the tests.
- floyd_test.txt, the output file.

- floyd_test01.m, tests I4MAT_FLOYD.
- floyd_test02.m, tests R8MAT_FLOYD.
- floyd_test03.m, tests I4MAT_FLOYD on matrices of increasing size, to get timing information.
- floyd_test03_sub.m, carries out a subtest for floyd_test03().
- floyd_test04.m, tests R8MAT_FLOYD on a nonconvex triangulation.
- floyd_test04.png, a PNG image of the contour plot of the distance from one node to all others.