The object may be globally reset via the seed_rng() function.

This fixes a bug in the "correlated" mode in random_rewire().

This implements a general "blockmodel" generation / rewiring algorithm,
using Gibbs acceptence / rejection sampling (a.k.a Metropolis-Hastings).

This also implements some optimizations in the rewiring code, which
makes it more efficient on filtered graphs.

This introduces several simplifications and corrections to the graph
rewire algorithm, to guarantee unbiased sampling.

Now a move is outright rejected if it produces a
self-loop/parallel-edge, instead of retried. This also adds a
"non-sweep" mode, where edges are rewired randomly, possibly with
repetition.

The edge moves are now simplified to the target of the edges only,
since swaping sources is redundant.

The number of iterations can now be explicitly modified, so it is not
necessary to call the function more than once, and it is emphasized in
the documentation that only after sufficiently many iterations can the
graph be guaranteed to be fully mixed.

This also changes the semantics of of bin list of size 2, and also
simplifies the histogram code slightly.

This fixes a leftover bug from the removal of the 'core' submodule.

Now the meaning of the bin edges given to the several histogram
functions are the same as in numpy/scipy. This means that the last bin
edge represents an upper bound on the last bin.

This fixes the expected values for several doctests, after
random_graph() re-factoring.

Small fixes of some examples in the docstrings.

This completes all the documentation up to this point.

This modified several docstrings and introduces a quick-start guide.

This adds vertex_average() and edge_average() to the stats module.

Reduce duplication of code for loading C++ modules.

Also, get rid of g.underlying_graph(), and rely on "private" variable
g._Graph__graph instead.

This is to avoid a common error of not being able to correctly normalize
a histogram because of truncated integer division.

The whole histogram code has been redone, and the code has been
simplified. The three-point vertex-edge-vertex correlation has been
scrapped, since it's not frequently used, and would make compilation
even more expensive.

This also adds some missing files to the generation routine.