The maximal-cliques package

[Tags:bsd3, library]

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 0.1, 0.1.1
Dependencies base (>3 && <5), containers, vector [details]
License BSD3
Author Gershom Bazerman
Stability Unknown
Category Algorithms
Uploaded Mon Dec 20 21:20:12 UTC 2010 by GershomBazerman
Distributions LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1, Tumbleweed:0.1.1
Downloads 621 total (10 in the last 30 days)
1 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees