Enumerate all maximal cliques of a graph.
|LTS Haskell 20.24:||0.1.1|
|Stackage Nightly 2023-06-04:||0.1.1|
|Latest on Hackage:||0.1.1|
Maintained by email@example.com
This version can be pinned in stack with:
Module documentation for 0.1.1
Enumerate all maximal cliques of a graph. A clique is a set of nodes such that there is an edge between every node and every other node in the set. A maximal clique is a clique such that no node may be added while preserving the clique property.