networkx.generators.random_graphs.gnm_random_graph¶
-
gnm_random_graph
(n, m, seed=None, directed=False)[source]¶ Returns a \(G_{n,m}\) random graph.
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.- Parameters
n (int) – The number of nodes.
m (int) – The number of edges.
seed (integer, random_state, or None (default)) – Indicator of random number generation state. See Randomness.
directed (bool, optional (default=False)) – If True return a directed graph
See also