This class template implements a generator for Erdös-Renyi
graphs, suitable for initializing an adjacency_list or other graph
structure with iterator-based initialization. An Erdös-Renyi
graph G = (n, p) is a graph with n vertices
that. The probability of having an edge (u, v) in G
is p for any vertices u and v. Typically,
there are no self-loops, but the generator can optionally introduce
self-loops with probability p.

Erdös-Renyi graphs typically exhibit very little
structure. For this reason, they are rarely useful in modeling
real-world problems. However, they are often used when determining
the theoretical complexity of complex graph algorithms.

Constructors

Constructs an Erdös-Renyi generator iterator that creates a
graph with n vertices and a given probability of the
total number of edges that a simple graph may have.
probability. Random vertices and edges are selected using the
random number generator gen. Self-loops are permitted only when
allow_self_loops is true.