graph_adj


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.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

graph_adj is available in a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

combo, a Python code which includes routines for ranking, unranking, enumerating and randomly selecting balanced sequences, cycles, graphs, Gray codes, subsets, partitions, permutations, restricted growth functions, Pruefer codes and trees.

digraph_adj, a Python code which carries out operations on digraphs, a directed graph. Information is stored in an adjacency matrix.

pagerank, a Python code which uses the eigenvalue (power method) and surfer (Markov chain) approaches to ranking web pages.

Source Code:


Last revised on 12 March 2023.