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.
Downloads
- maximal-cliques-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.1.1 |
---|---|
Dependencies | base (>3 && <5), containers, vector [details] |
License | BSD-3-Clause |
Author | Gershom Bazerman |
Maintainer | gershomb@gmail.com |
Category | Algorithms |
Uploaded | by GershomBazerman at 2010-12-20T21:20:12Z |
Distributions | LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1 |
Reverse Dependencies | 2 direct, 0 indirect [details] |
Downloads | 2775 total (11 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |