GitLab

This makes the code more efficient if the input parameter combinations
are much larger than the graph itself.

This changes stlightly the information passed to the auxiliary functions
provided by the user, so that more arbitrary structures can be
constructed more easily.

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.

Now, if 'm' is larger than the seed graph, it is set to the size of the
seed graph, and is increased progressively until it matches the desired
value. This removes the need to start with a random seed graph of the
appropriate size.

This also includes modifications which make the code more robust
against parameter choices which don't make much sense, e.g. lead to
negative probabilites.

This fixes ticket 61:

http://projects.skewed.de/graph-tool/ticket/61

Now, whenever GraphWrap is being used, the property maps are always
in "checked" mode.

This enables support for older versions of GCC (>=4.2), by falling back
to the boost tr1 implementation when the GCC version is less than 4.4.

Vectors are used now instead of unordered_sets, which dramatically
improves performace.

This fixes a bug where edges were left unindexed.

Now the degree sequence is verified with Erdös-Gallai inequalities, and
the edges are connected in a deterministic fashion. The edges then are
rewired with the random_rewire() function.

This includes also some internal refactoring, and bug fixes.

This extensively modifies the random_rewire() algorithm, so that only
either the source or the edge of each edge is rewired (not both, as
previously), and no parallel edges are created during the algorithm (if
desired).

The new version is much faster, and never gets stuck. However, more than
one run may be necessary in order to obtain a uniform shuffling.

This fixes a implicit directionality bug in random_rewire() with
undirected graphs.

This fixes a problem, where the underlying edge directionality would
cause correlations to arise when rewiring undirected graphs. Now each
edge is correctly considered in both possible orientations, which are
chosen randomly.

This allows compilation with older versions of boost (>=1.38), which in
some sistems are the only option. This commit also removes the linking
of the boost_graph shared library, since none of its symbols are
actually required.

This implements a simpler rewire strategy where the edges are randomly
placed, without preserving the degrees of the vertices.

It is necessary to use -frounding-math to avoid run-time errors with
certain versions of CGAL.

This also includes the library CGAL as a dependency.

Fix compilation warnings with boost 1.40, remove unnecessary files, fix
autoconf macros and link with "boost_graph".

This also raises the minimum boost version to 1.40.

The file graph_predecessor.hh was missing.