GitLab

Small fixes of some examples in the docstrings.

This completes all the documentation up to this point.

This returns the union of two graphs, and optionally specified property
maps.

Target degrees were not being sampled correctly from their probability.

random_graph() now uses a modified algorithm for generation of
correlated graphs, which is more efficient. Instead of giving a function
which returns a sample of the correlated target degree, the user must
give a function which will just compute its probability. This
probability will then be used to choose the edges.

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

The seed option is now correctly interpreted.

Reduce duplication of code for loading C++ modules.

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

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.