toms097, a FORTRAN90 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.
The text of many ACM TOMS algorithms is available online through ACM: https://calgo.acm.org/ or NETLIB: https://www.netlib.org/toms/index.html.
The computer code and data files made available on this web page are distributed under the MIT license
toms097 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 FORTRAN90 code 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 FORTRAN90 code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.
FLOYD, a FORTRAN90 code which implements Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.
GRAFPACK, a FORTRAN90 code which computes various quantities associated with mathematical graphs.