GitLab

Dumping boost::adjacency_list<> improves memory usage by a factor of
two, and also slightly improves performance in some cases.

This enables the inclusion of the non-boost tr1 headers if a recent
enough version of libstdc++ is detected. This als fixes a bug with
clang when sparsehash pulls unwanted tr1 headers.

This also synchronizes the code with the most recent boost version
(1.52).

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

This also keeps compatibility with earlier versions of boost.

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.

This fixes a bug in the motifs() code which generates a segfault for
certain subgraph signatures. This also fixes a potential problem for
multithreaded execution.

In both functions we can save some time by hashing the subgraphs found,
according to their degree distribution signature (instead of number of
edges). This avoids a large number of useless exactness or isomorphism
comparisons.

This also removes the "seed" parameter, which is redundant to
the numpy.random.seed() function.

The RNG object must be passed by _reference_ not by value, as is the
default! Otherwise the RNG state does not change...

The generators from boost::random seem to have a bug which causes them
to be biased. The generators from tr1::random seem to be in better
shape.

See: http://thread.gmane.org/gmane.comp.lib.boost.user/48006

This also doesn't build a parallel vertex list if motifs aren't being
sampled.

Thins changes the graph filtering code slightly to wrap graph types with
GraphWrap, which automatically updates the edge index list when edges
are removed and added to the graph.

This also changes how graphs are passed to algorithms, which is now by
reference instead of pointer. (hence this touches lots of code, but
changes are trivial)

This implements an efficient motif counting algorithm.