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.

Properties

Versions0.1, 0.1.1
Change logNone available
Dependenciesbase (>3 && <6), containers, vector [details]
LicenseBSD3
AuthorGershom Bazerman
Maintainergershomb@gmail.com
CategoryAlgorithms
Source repositoryhead: darcs get http://hub.darcs.net/gershomb/maximal-cliques
UploadedSun Mar 22 21:35:39 UTC 2015 by GershomBazerman
DistributionsLTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1
Downloads381 total (29 in last 30 days)
Votes
1 []
StatusDocs available [build log]
Last success reported on 2015-03-22 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees