digraph_arc, a MATLAB 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 MATLAB code which handles various problems associated with a set of "cities" on a map.
digraph_adj, a MATLAB 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 MATLAB code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.
graph_adj, a MATLAB 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_arc, a MATLAB code which carries out operations on graphs. Information is stored in an arc list, pairs of nodes forming edges. Operations include the chromatic polynomial, computing degrees, computing the degree sequence, counting the edges, determining edge and node connectivity, Euler circuits, spanning trees, shortest path, printing the arc list, generating fixed and random examples.
graph_dist, a MATLAB 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 MATLAB code which reads and writes GRF files.
test_digraph_arc, a MATLAB code which defines a number of examples of directed graphs ("digraphs"), The definition is stored as an adjacency matrix.
toms097, a MATLAB code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.
treepack, a MATLAB code which carries out computations on trees, a simple kind of graph that is minimally connected.