**floyd_test**,
a FORTRAN90 code which
calls floyd(), which
implements 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 MIT license

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

- floyd_test.f90, a sample calling code.
- floyd_test.sh, runs all the tests.
- floyd_test.txt, the output file.