grafpack

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:

• COLOR_DIGRAPH_ADJ is a directed graph whose nodes are colored;
• COLOR_GRAPH_ADJ is an undirected graph whose nodes are colored;
• DIGRAPH_ADJ is a directed graph described by an adjacency matrix;
• DIGRAPH_ARC is a directed graph described by an edge list;
• FACE is a collection of "faces" defined by circuits in a graph;
• GRAPH_ADJ is an undirected graph described by an adjacency matrix;
• GRAPH_ARC is an undirected graph described by an edge list;
• GRAPH_DIST is an undirected graph described by a distance matrix;
• MAZE is a maze;

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

grafpack is available in a FORTRAN90 version.

Related Data and Programs:

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.

grafpack_test

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.

Reference:

1. Alan Gibbons,
   Algorithmic Graph Theory,
   Cambridge University Press, 1985,
   ISBN: 0-5212-8881-9,
   LC: QA166.G53.
2. Hang Tong Lau,
   Combinatorial Heuristic Algorithms with FORTRAN,
   Springer, 1986,
   ISBN: 3540171614,
   LC: QA402.5.L37.
3. Albert Nijenhuis, Herbert Wilf,
   Combinatorial Algorithms for Computers and Calculators,
   Second Edition,
   Academic Press, 1978,
   ISBN: 0-12-519260-6,
   LC: QA164.N54.
4. Robert Sedgewick,
   Algorithms in C,
   Addison-Wesley, 1990,
   ISBN: 0-201-51425-7,
   LC: QA76.73.C15S43.
5. Dennis Stanton, Dennis White,
   Constructive Combinatorics,
   Springer, 1986,
   ISBN: 0387963472,
   LC: QA164.S79.
6. Krishnaiyan Thulasiraman, M Swamy,
   Graphs: Theory and Algorithms,
   John Wiley, 1992,
   ISBN: 0471513563,
   LC: QA166.T58.

Source Code:

• grafpack.f90, the source code;
• grafpack.sh, compiles the source code;