This also includes the library CGAL as a dependency.

This is a wrapper around BGL's boyer_myrvold_planarity_test.

Now use _best weights_ to in-neighbours to determine trust, to avoid path
multiplicity catastrophe.

This also adds the epsilon parameter, which drops paths with weight
below this value.

It is now possible to obtain the vertex with index i even for filtered graphs.

It is not useful to store vertices by index when the vertices are being
filtered, since Graph.vertex() does not map to index in this case.

Since the same edge appears twice in Vertex.all_edges() if it is a
self_loop, it would be deleted twice in Graph.clear_vertex(), raising an
exception. Now, the edges are stored in a set first, avoiding this
problem.

Small fixes of some examples in the docstrings.

This fixes a crash when a "valid" copy of an invalid edge descriptor is
removed from the graph. Now the invalidity of the descriptor is detected
and exposed.

This fixes the problem of generating invalid Makefiles when more than
one python installation is found.

Use the original, simpler, path weight calculation.

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 includes the shortest_distance() function in the topology module.

This is a workaround for strange entries in sys.path; either dirs that
don't exist, or are in unicode.

Properties with empty values are now simply not printed in the output.

Some property typles wrongly included the index map, when they
shouldn't.

This fixes how paths are weighted in the absolute_trust algorithm.