Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
fast_gnp_random_graph¶

fast_gnp_random_graph
(n, p, seed=None, directed=False)[source]¶ Returns a random graph, also known as an ErdősRényi graph or a binomial graph.
Parameters: Notes
The graph algorithm chooses each of the (undirected) or (directed) possible edges with probability .
This algorithm runs in time, where is the expected number of edges, which equals . This should be faster than
gnp_random_graph()
when is small and the expected number of edges is small (that is, the graph is sparse).See also
References
[1] Vladimir Batagelj and Ulrik Brandes, “Efficient generation of large random networks”, Phys. Rev. E, 71, 036113, 2005.