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.
The information on this web page is distributed under the MIT license.
digraph_arc is available in a Fortran90 version and a MATLAB version and an Octave version and a Python version.
cities, a Python code which handles various problems associated with a set of "cities" on a map.
digraph_adj, a Python 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.
floyd, a Python code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.
graph_arc, a Python code which carries out operations on graphs. Information is stored in an arc list, pairs of nodes forming edges.
graph_dist, a Python code which carries out operations on abstract graphs, defined by undirected edges with an associated distance matrix.
grf, a data directory which contains a description of the GRF format and some examples.
grf_io, a Python code which reads and writes GRF files.
test_digraph_arc, a Python code which defines a number of examples of directed graphs ("digraphs"), The definition is stored as an adjacency matrix.
toms097, a Python code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.