graph_adj_test


graph_adj_test, a FORTRAN90 code which calls graph_adj(), 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

Related Data and Programs:

graph_adj, a Fortran90 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.

Source Code:


Last revised on 12 March 2023.