color_digraph_adj


color_digraph_adj, a Fortran90 code which carries out operations on color graphs, a directed graph in which each node has been assignd a color. That information is stored in an adjacency matrix in which the diagonal elements record colors. Operations include counting the colors, computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the adjacency matrix, and generating fixed and random examples.

Licensing:

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

Languages:

color_digraph_adj is available in a Fortran90 version.

Related Data and Programs:

color_digraph_adj_test

codepack, a FORTRAN90 code which computes "codes" that can determine if two graphs are isomorphic.

floyd, a FORTRAN90 code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.

graph_theory, a Fortran90 code which carries out operations on abstract graphs, such as a breadth-first-search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure. Objects include undirected and directed graphs, weighted graphs, and trees.

graph_representation, a data directory which contains examples of ways of representing abstract mathematical graphs

grf, a data directory which contains a description of the GRF format and some examples.

grf_io, a FORTRAN90 code which reads and writes GRF files.

maze, a Fortran90 code which carries out operations on a maze, including the diameter, a random example, or a path that solves the maze.

toms097, a FORTRAN90 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.

treepack, a FORTRAN90 code which carries out computations on trees, a simple kind of graph that is minimally connected.

Source Code:


Last revised on 01 March 2023.