a MATLAB program which
calls floyd() to demonstrate 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.
Related Data and Programs:
a MATLAB library which
implements Floyd's algorithm for finding the shortest distance
between pairs of nodes on a directed graph.
calls all the tests.
runs all the tests.
the output file.
tests I4MAT_FLOYD on matrices of increasing size,
to get timing information.
carries out a subtest for floyd_test03().
tests R8MAT_FLOYD on a nonconvex triangulation.
a PNG image of the contour plot of the distance
from one node to all others.
Last revised on 18 January 2019