Summary

Implement maximum clique

Motivation

There have been such efforts in the past but they were not merged. (#72) If possible, we would like to merge after resolving the conflicts. If that seems difficult, I may need to write my own algorithm.

Details

• What code needs to change? New traits? Which modules?

• Is this a new graph algorithm? Include links to papers, Wikipedia, or other
  implementations of this algorithm that exist.

In previous commits, this was implemented by the Bron-Kerbosch algorithm.
https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm

• Are you willing to implement this yourself? Mentor someone else and help them
  implement it?

I would like your help as I lack experience in participating in OSS and am not confident that I can do it all on my own.