GitLab

This essentially replaces "neighbours" by "neighbors" throughout.

Aliases using the British spelling (e.g. Vertex.out_neighbours()) are
preserved for compatibility.

This changes the underlying adjacency matrix implementation to a single
mixed in + out edge list for each node, instead of separate ones. This
simplifies the undirected_adaptor<> so that its out-edge iterators
become trivial, and also faster.

Now algorithms rely more on parallel_{vertex/edge}_loop() and global
the paralellization threshold is honored.

This fixes a bug where the isomorphism class for undirected subgraphs
was wrongly computed using their directed view.

This also implements direct manipulation of OpenMP settings (schedule
and number of threads) via python.

Use schedule(static, 100), to reduce overhead with small graphs in the
majority of cases.

This returns an optional list of locations of the motifs found in the
main graph.

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.