maximal-cliques: Enumerate all maximal cliques of a graph.

[ 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.

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.1.1
Dependencies base (>3 && <6), containers, vector [details]
License BSD-3-Clause
Author Gershom Bazerman
Maintainer gershomb@gmail.com
Category Algorithms
Source repo head: darcs get http://hub.darcs.net/gershomb/maximal-cliques
Uploaded by GershomBazerman at 2015-03-22T21:35:39Z
Distributions LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 2715 total (13 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-03-22 [all 1 reports]