Replace hashsets with bitsets in maximal_cliques.

The maximal_cliques code was spending most of its time intersecting sets; bitsets support this operation much more efficiently. This gives about a 5x speedup in my tests on 200-vertex Erdos-Renyi graphs.

It does depend on the vertices all being integers, but I can't work out how to construct a useful graph with non-integer vertices anyway.