This fixes a bug where some matches were skipped, due to a spurious,
abrupt termination of the search.

This also changes the default argument to 'random=False'.

Images are now converted to png a posteriori for html output, but are
used as pdf for latex.

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 fixes a bug where filtered vertices would be incorrectly marked, if
the largest component index happend to be zero.

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

Added more DOI links to references, and other cosmetic changes.

This allows for sampling of random subgraph isomorphisms.

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

This implements a shortest_path() function which returns the shortest
path between two vertices.

This also modifies shortest_distances, such that a predecessor map is
optionally returned.

Support for edge/vertex labelling is 99% done, but it is currently
impractical to compile with GCC. If GCC 4.5 doesn't do a better job,
then a workaround would be necessary.

This is a wrapper around BGL's boyer_myrvold_planarity_test.

This includes the shortest_distance() function in the topology module.

This completes all the documentation up to this point.