# The maximal-cliques package

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

Versions | 0.1, 0.1.1 |
---|---|

Change log | None available |

Dependencies | base (>3 && <6), containers, vector [details] |

License | BSD3 |

Author | Gershom Bazerman |

Maintainer | gershomb@gmail.com |

Category | Algorithms |

Source repository | head: darcs get http://hub.darcs.net/gershomb/maximal-cliques |

Uploaded | Sun Mar 22 21:35:39 UTC 2015 by GershomBazerman |

Distributions | LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1 |

Downloads | 492 total (13 in last 30 days) |

Votes | |

Status | Docs available [build log] Last success reported on 2015-03-22 [all 1 reports] |

## Modules

*Data**Algorithm*

[Index]

## Downloads

- maximal-cliques-0.1.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees