gnm_random_graph(n, m, seed=None, directed=False)
In the $G_{n,m}$ model, a graph is chosen uniformly at random from the set of all graphs with $n$ nodes and $m$ edges.
This algorithm should be faster than dense_gnm_random_graph
for sparse graphs.
The number of nodes.
The number of edges.
Indicator of random number generation state. See Randomness<randomness>
.
If True return a directed graph
Returns a $G_{n,m}$ random graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.bipartite.generators.gnmk_random_graph
networkx.generators.random_graphs.dense_gnm_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