networkx.generators.random_graphs.dense_gnm_random_graph

networkx.generators.random_graphs.dense_gnm_random_graph(n, m, seed=None)

Return the random graph G_{n,m}.

Gives a graph picked randomly out of the set of all graphs with n nodes and m edges. This algorithm should be faster than gnm_random_graph for dense graphs.

Parameters :

n : int

The number of nodes.

m : int

The number of edges.

seed : int, optional

Seed for random number generator (default=None).

See also

gnm_random_graph

Notes

Algorithm by Keith M. Briggs Mar 31, 2006. Inspired by Knuth’s Algorithm S (Selection sampling technique), in section 3.4.2 of [R114].

References

[R114]

(1, 2) Donald E. Knuth, The Art of Computer Programming, Volume 2/Seminumerical algorithms, Third Edition, Addison-Wesley, 1997.