GitLab

This fixes #189

The graphml reader no longer builds a list of edges/vertices during
parsing, whenever the graph uses canonical names.

This fixes ticket #131, and includes a 'fast' O(k) option, which
changes the vertex index ordering.

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

After the removal of filtered vertices via Graph.purge_vertices(), the
values of known property maps are now kept consistent with the
unmodified graph.

Now properties can be copied from vertices which are not identical
(e.g. from unfiltered to filtered graphs, etc). This fixes a problem
with graph copying and pruning, where the properties were not correclty
copied.

This implements a GraphView class which allows for convenient,
independent filtering graphs.

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.

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.

This fixes an obvious problem, where the graph gets deleted, and the
descriptors are still lying around. Usage of orphaned descriptors will
now just raise a ValueError.

The __repr__ function of Edge, Vertex, and PropertyMap now give
something more informative about each object.

This is a large commit which replaces lambda::bind with boost::bind in
most parts of the code. This improves compilation time, and slightly
decreases compilation memory usage in some cases.

No longer only thrown GraphError upon any error, but instead throw
specific exceptions which are more meaninful and are mapped to standard
python exceptions, such as IOError, ValueError and RuntimeError.

Fix bad_any_cast bug when passing a weight property.

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 makes the naming more sensible.

Now inline() automatically converts known variables (such as property
maps) and defaults to boost::python objects, instead of scxx objects.

The code now is only generated for the current filtered, reversed and/or
directed status of the graph, reducing compile time and binary size.

Edge modification (remove and add) is now protected by a GraphWrap
class, which takes care of the edge index housekeeping, which does not
need to be done by hand anymore.

The function is also no longer bound to one graph, and can take an
arbitrary number of variables of known or unknown types, including
graphs.