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.

This completes all the documentation up to this point.

This dumps the random-path approach, and implements a deterministic,
priority queue algorithm.

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.

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.

Mostly in the flow and spectral modules.

The file graph_predecessor.hh was missing.

The value "random" should be "uncorrelated" instead.

Call to random() must be protected by "omp critical".

This returns the union of two graphs, and optionally specified property
maps.