fast_gnp_random_graph(n, p, seed=None, directed=False)
The $G_{n,p}$ graph algorithm chooses each of the $[n (n - 1)] / 2$ (undirected) or $n (n - 1)$ (directed) possible edges with probability $p$.
This algorithm runs in $O(n + m)$ time, where :None:None:`m` is the expected number of edges, which equals $p n (n - 1) / 2$. This should be faster than gnp_random_graph
when $p$ is small and the expected number of edges is small (that is, the graph is sparse).
The number of nodes.
Probability for edge creation.
Indicator of random number generation state. See Randomness<randomness>
.
If True, this function returns a directed graph.
Returns a $G_{n,p}$ random graph, also known as an Erdős-Rényi graph or a binomial graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.generators.random_graphs.gnp_random_graph
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them