In G(n,p) graphs, the graph has ‘n’ vertices and for each edge the
probability that it is present in the graph is ‘p’.

In G(n,m) graphs, the graph has ‘n’ vertices and ‘m’ edges,
and the ‘m’ edges are chosen uniformly randomly from the set of all
possible edges. This set includes loop edges as well if the `loops`

parameter is TRUE.

`random.graph.game`

is an alias to this function.