Use schedule(static, 100), to reduce overhead with small graphs in the
majority of cases.

Fully remove the filter stash and associated functions in the Graph
class, in favor of using GraphView uniquely.

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.