graph_adj_list, a Python code which carries out operations on abstract graphs, with undirected edges, described by an adjacency list. An adjacency list is a compressed version of the adjacency matrix.
The information on this web page is distributed under the MIT license.
graph_adj_list is available in a MATLAB version and an Octave version and a Python version.
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.
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, including the computation of a minimum spanning tree.
test_graph_adj_list, a Python code which defines a number of examples of graphs, The definition is stored as an adjacency list.