Graph generators

See also

NetworkX Graph generators

fast_labeled_binomial_graph(n, p, *[, ...])	Returns a \(G_{n,p}\) random graph, also known as an Erdős-Rényi graph or a binomial graph.
labeled_barabasi_albert_graph(n, m, *[, ...])	Returns a random graph according to the Barabási–Albert preferential attachment model.
labeled_binomial_graph(n, p, *[, labels, ...])	Returns a \(G_{n,p}\) random graph, also known as an Erdős-Rényi graph or a binomial graph.
labeled_cycle_graph(n[, label])	Returns a cycle graph \(C_n\) of cyclically connected nodes.
labeled_scale_free_graph(n, *[, alpha, ...])	Returns a scale-free directed graph.
labeled_two_cycles_graph(n, m, *[, ...])	Returns a graph with two cycles connected by one node.