**graph_class**,
a Python code which
creates classes related to abstract graphs, and uses them to define
various algorithms include breadth-first search, depth-first search,
and shortest path.

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

**graph_class** is available in
a Python version.

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.

digraph_dict, a Python code which carries out operations on abstract digraphs, with directed edges, represented by a Python dictionary. The dictionary has a key for each node; the values list the nodes which are immediately reachable from the key node.

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.

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

- graph_class.py, the source code.
- graph_class.sh, runs all the tests.
- graph_class.txt, the output file.