floyd, an Octave code 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 MIT license
floyd is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
cities, a dataset directory which contains a number of city distance datasets.
graph_representation, a data directory of examples of ways of representing abstract mathematical graphs
grf, a data directory which contains a description of the grf format and some examples.
grf_io, an Octave code which reads and writes grf files.
toms097, an Octave code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using floyd's algorithm.