toms097, a FORTRAN77 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.
The computer code and data files made available on this web page are distributed under the GNU LGPL license.
toms097 is available in a C version and a C++ version and a FORTRAN77 version and a FORTRAN90 version and a MATLAB version and a Python version.
cities, a FORTRAN90 library which handles various problems associated with a set of "cities" on a map.
CITIES, a dataset directory which contains a number of city distance datasets.
DIJKSTRA, a FORTRAN77 program which runs a simple example of Dijkstra's minimum distance algorithm for graphs.
FLOYD, a FORTRAN77 library which implements Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.