maximal-cliques

Enumerate all maximal cliques of a graph.

LTS Haskell 22.39:	0.1.1
Stackage Nightly 2024-10-29:	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 [email protected]

This version can be pinned in stack with:maximal-cliques-0.1.1@sha256:deb77e63e5126703bdfd9c17cb09da0af9ee54ddcc59b54e29ddfece51ad4670,857

Module documentation for 0.1.1

Data
- Data.Algorithm
  - Data.Algorithm.MaximalCliques

Depends on 3 packages(full list with versions):

base, containers, vector

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.