maximal-cliques: Enumerate all maximal cliques of a graph.
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.
|Versions [faq]||0.1, 0.1.1|
|Dependencies||base (>3 && <6), containers, vector [details]|
|Source repo||head: darcs get http://hub.darcs.net/gershomb/maximal-cliques|
|Uploaded||by GershomBazerman at Sun Mar 22 21:35:39 UTC 2015|
|Distributions||LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1|
|Downloads||1311 total (41 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2015-03-22 [all 1 reports]
For package maintainers and hackage trustees