floyd_test

floyd_test, a Fortran77 code which demonstrates Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

floyd, a Fortran77 code which demonstrates Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.

Source Code:

• floyd_test.f, a sample calling program.
• floyd_test.sh, commands to compile and run the sample program.
• floyd_test.txt, the output file.