Enumerate all maximal cliques of a graph.

Version on this page:0.1.1
LTS Haskell 13.21:0.1.1
Stackage Nightly 2019-05-18:0.1.1
Latest on Hackage:0.1.1

See all snapshots maximal-cliques appears in

BSD-3-Clause licensed by Gershom Bazerman
Maintained by

Module documentation for 0.1.1

There are no documented modules for this package.

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.

Depends on 3 packages:
Used by 1 package:
comments powered byDisqus