floyd, a Fortran90 code which implements Floyd's algorithm for finding the shortest distance between every pair of nodes in a directed graph.
The information on this web page is 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.
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.