The maximal-cliques package

[ Tags: algorithms, bsd3, library ] [ Propose Tags ]

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 && <6), containers, vector [details]
License BSD3
Author Gershom Bazerman
Category Algorithms
Source repo head: darcs get
Uploaded Sun Mar 22 21:35:39 UTC 2015 by GershomBazerman
Distributions LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1, openSUSE:0.1.1
Downloads 971 total (26 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-03-22 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees