maximal-cliques

Enumerate all maximal cliques of a graph.

Version on this page:0.1.1
LTS Haskell 8.2:0.1.1
Stackage Nightly 2017-02-25:0.1.1
Latest on Hackage:0.1.1
BSD3 licensed by Gershom Bazerman
Maintained by gershomb@gmail.com

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.

Depends on:
Used by 1 package:
comments powered byDisqus