]>

Most functions that create graphs in a deterministic manner are documented here. See also stochastic generators, spatial graph generators, bipartite graph generators, and operators that transform graphs.

These functions create graphs from weighted or unweighted adjacency matrices, or an adjacency list.

These functions produce various basic regular graph structures, such as paths, cycles or lattices.

These functions generate tree graphs.

These functions generate graphs with the specified degrees.

These functions produce single and multipartite complete graphs, as well as related graphs.

These functions return graphs from various graph collections.