grafpack, a FORTRAN90 code which performs common calculations involving (abstract mathematical) graphs.
This includes such tasks as a breadth-first-search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure. Some algorithms are general, while others apply only to directed graphs or trees.
Some of the routine names begin with a prefix that indicates the type of object it is associated with:
The computer code and data files described and made available on this web page are distributed under the MIT license
grafpack is available in a FORTRAN90 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.
codepack, a FORTRAN90 code which computes "codes" that can determine if two graphs are isomorphic.
floyd, a FORTRAN90 code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.
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.
toms097, a FORTRAN90 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.
treepack, a FORTRAN90 code which carries out computations on trees, a simple kind of graph that is minimally connected.