This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
gnm_random_graph(n, m, seed=None, directed=False)¶
Returns a random graph.
In the model, a graph is chosen uniformly at random from the set of all graphs with nodes and edges.
This algorithm should be faster than
dense_gnm_random_graph()for sparse graphs.