This avoid a namespace clash when using run_action.inline().

These functions/properties provide more information and control about
edge indexing, which might be useful.

The reserved size for the array was set to g.num_edges(), but it should
be set to the maximum edge index + 1, since some edges might have been
deleted.

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.

The module dl has been deprecated, and has been replaced by ctypes. This
also fixes a problem where the dlopen() flags have different numbers in
different architectures.

Now the meaning of the bin edges given to the several histogram
functions are the same as in numpy/scipy. This means that the last bin
edge represents an upper bound on the last bin.

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.

This fixes a race condition when undirected graphs are used, and when
OpenMP is enabled.

This fixes a bug where the distance map was not properly initialized
when the graph is filtered, and the all pairs shortest paths are
requested.

This allows for sampling of random subgraph isomorphisms.

Now vector types of property maps can be accessed as arrays with the
get_array() and 'a' property, just like scalar property maps.

This fixes a small typo bug, which prevented loading from file-like
objects.

Edges were not properly indexed after graph generation.

This improves the binning performace, when suplied bins are of constant
width.

absolute_trust() is now called trust_transitivity(), and the whole
trust matrix can now be efficiently calculated.

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

This fixes a bug where edges were left unindexed.

This also maintains compatibility with older boost versions.