Generators for the small graph atlas.
See “An Atlas of Graphs” by Ronald C. Read and Robin J. Wilson, Oxford University Press, 1998.
Because of its size, this module is not imported by default.
Generators for some classic graphs.
The typical graph generator is called as follows:
>>> G=nx.complete_graph(100)
returning the complete graph on n nodes labeled 0,..,99 as a simple graph. Except for empty_graph, all the generators in this module return a Graph class (i.e. a simple, undirected graph).
Various small and named graphs, together with some compact generators.
Generators for random graphs.
Generate graphs with a given degree sequence or expected degree sequence.
Generators for some directed graphs.
gn_graph: growing network gnc_graph: growing network with copying gnr_graph: growing network with redirection scale_free_graph: scale free directed graph
Generators for geometric graphs.
Hybrid
Generators and functions for bipartite graphs.
Line graphs.
Ego graph.
Stocastic graph.