The rewiring algorithm to be used. It can be one of the
following: simple: simple rewiring algorithm which
chooses two arbitrary edges in each step (namely (a,b) and (c,d))
and substitutes them with (a,d) and (c,b) if they don't y
niter
Number of rewiring trials to perform.
Value
A new graph object.
Details
This function generates a new graph based on the original one by
randomly rewiring edges while preserving the original graph's degree
distribution.