**graph_adj_test**,
a FORTRAN90 code which
calls graph_adj(), which
carries out operations on abstract graphs, with undirected edges,
represented by an adjacency matrix. Operations include breadth-first
search, the computation of a minimum spanning tree,
an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive
closure.

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

graph_adj, a Fortran90 code which carries out operations on abstract graphs, with undirected edges, represented by an adjacency matrix. Operations include breadth-first search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure.

- graph_adj_test.f90, calls all the tests.
- graph_adj_test.sh, runs all the tests;
- graph_adj_test.txt, the output file.