where the authors show that using that rule guarantees that the Bron-Kerbosch algorithm has
worst-case running time $O(3^{n/3})$ where $n$ is the number of vertices of the graph, excluding
time to write the output, which is worst-case optimal.

The algorithm first computes all maximal cliques and then returns the result to the user. A
timeout can be set using the constructor parameters.