This removes old dependency on an outdated graph wrapper which did edge
index housekeeping.

This returns an optional list of locations of the motifs found in the
main graph.

Ensure in/out_edge/adjacency_iterator and associated are random access in adj_ist<> and UndirectedAdaptor<>

This implements indirect array access to property maps with vector
values.

This changes the way search visitors are wrapped, such that the original
class remains unmodified. With the previous code, the original classes
would be repeatedly modified, adding unnecessary overhead, and even
possibly causing the number of nested calls to exceed the maximum
threshold.

This also improves some of the existing shuffling strategies with a fast
alias sampling. The parameter names of the random_graph() and
random_rewire() functions have been made more consistent.

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