Partition algorithms are added to the partition package:
- Girvan-Newman community detection algorithm for undirected graphs.
- Approximate k-cut of an undirected graph using a randomized contraction algorithm (generalization of Karger’s min-cut).
- Bron–Kerbosch algorithm with pivot selection, degeneracy ordering, and bitsets to find all maximal cliques.