floyd, a FORTRAN90 code 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 is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
BELLMAN_FORD, a FORTRAN90 code which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.
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.
CODEPACK, a FORTRAN90 code which computes "codes" that can determine if two graphs are isomorphic.
DIJKSTRA, a FORTRAN90 code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.
GRAFPACK, a FORTRAN90 code which computes various quantities associated with mathematical graphs.
GRAPH_REPRESENTATION, a data directory which contains 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, a FORTRAN90 code which reads and writes GRF files.
GRF_TO_EPS, a FORTRAN90 code which can make an encapsulated PostScript image of a GRF file.
SUBSET, a FORTRAN90 code which generates, ranks and unranks various combinatorial objects.
TABLE_GRAPH_CODE, a FORTRAN90 code which reads a TABLE file describing a graph, and computes its graph code.
TOMS097, a FORTRAN90 code which implements Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.