Clique finding

[dfacoet]

networkx has some functions to find cliques.
These algorithms have exponential running time, but can be useful in practice for small problems.

What is the expected enhancement?

Add some functions to find cliques, e.g. similar to networkx.enumerate_all_cliques.

[MIWdlB]

If the proposal is just to copy over the functions from networkx, I'd like to give it a go so I can get to know the repo