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.
The information on this web page is distributed under the MIT license.
digraph_dict 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.
graph_adj, a Python code which carries out operations on graphs. 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.
