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.


Versions0.1, 0.1.1
Change logNone available
Dependenciesbase, containers, vector
AuthorGershom Bazerman
Source repositoryhead: darcs get
UploadedSun Mar 22 21:35:39 UTC 2015 by GershomBazerman
DistributionsLTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1
Downloads350 total (25 in last 30 days)
StatusDocs available [build log]
Last success reported on 2015-03-22 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees