test_graph_adj a Python code which defines a number of examples of graphs in terms of an adjacency matrix.
The information on this web page is distributed under the MIT license.
test_graph_adj 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.
test_digraph_adj, a Python code which defines a number of examples of directed graphs ("digraphs"), The definition is stored as an adjacency matrix.
test_graph_arc, a Python code which defines a number of examples of graphs, The definition is stored as an arc list.