**digraph_adj_test**,
a Fortran90 code which
calls digraph_adj(), which
carries out operations on digraphs, a directed graph.
Information is stored in an adjacency matrix.
Operations include computing in- and out-degrees,
computing the in- and out-degree sequences, counting the edges,
printing the adjacency matrix, generating fixed and random examples.

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

digraph_adj, a Fortran90 code which carries out operations on digraphs, a directed graph. Information is stored in an adjacency matrix. Operations include computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the adjacency matrix, generating fixed and random examples.

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