graph_dist, a Python code which carries out operations on abstract graphs, defined by undirected edges with an associated distance matrix.
The information on this web page is distributed under the MIT license.
graph_dist is available in a Fortran90 version and a MATLAB version and an Octave version and a Python version.
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_adj, a Python 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.
grf_io, a Python code which reads and writes GRF files.
toms097, a Python code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.