GitLab

This replaces a custom implementation of Ullmann's code.

Now default constructed edge descriptors are impossible to occur in
regular graphs.

This switches the edge_descriptor type in adj_list<> from std::tuple to
a custom struct.

This also implements direct manipulation of OpenMP settings (schedule
and number of threads) via python.

Now, if either vertex or edge filtering is enabled, simultaneous
filtering is activated. By not considering vertex or edge filtering in
completely independent fashion, the compile time memory requirements
reduced to about 50%.

This fixes ticket #167

This fixes problems with transposed arrays, or arrays with arbitrary strides.

This also changes the semantics of random_rewire() when parallel edges
/ self loops are forbidden, but the initial graph contains them. Now,
instead of throwing an exception, the rewiring is attempted, with no
new parallel edges / self-loops being created. Under some
circumstances, if the degree sequence is graphical, eventually the
graph can become simple after sufficiently many sweeps.