This makes the code more efficient if the input parameter combinations
are much larger than the graph itself.

This fixes a bug where some matches were skipped, due to a spurious,
abrupt termination of the search.

This also changes the default argument to 'random=False'.

This avoids copying property values when not necessary, if the index
remains the same after purging

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

This fixes ticket #92.

This includes user-defined types, as well as vector types and strings.
This affects dijkstra_search(), astar_search() and bellman_ford_search().

This fixes the edge invalidation check, when either the source of the
target vertex is removed.

This also makes all Edge classes inherit from the same base class of the
same name.

This fixes tickets #94 and #95

This fixes ticket #85.

This works around a regression introduced in boost 1.48, relating to the
edge descriptors of reversed graphs.

See: https://svn.boost.org/trac/boost/ticket/6391

This fixes ticket #84

This changes stlightly the information passed to the auxiliary functions
provided by the user, so that more arbitrary structures can be
constructed more easily.