test_digraph_arc a Python code which defines a number of examples of directed graphs ("digraphs") in terms of an arc list (pairs of nodes connected by a link).
The information on this web page is distributed under the MIT license.
test_digraph_arc is available in a Fortran90 version and a MATLAB version and an Octave version and a Python version.
digraph_arc, a Python code which carries out operations on digraphs, a directed graph. Information is stored in an arc list, pairs of nodes forming edges. Operations include computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the arc list, generating fixed and random examples.
test_digraph_adj, a Python code which defines a number of examples of directed graphs ("digraphs"), The definition is stored as an adjacency matrix.