# 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 && <5), containers, vector [details] |

License | BSD3 |

Author | Gershom Bazerman |

Maintainer | gershomb@gmail.com |

Category | Algorithms |

Uploaded | Mon Dec 20 21:20:12 UTC 2010 by GershomBazerman |

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

Downloads | 465 total (15 in last 30 days) |

Votes | |

Status | Docs uploaded by user Build status unknown [no reports yet] |

## Modules

*Data**Algorithm*

[Index]

## Downloads

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

#### Maintainers' corner

For package maintainers and hackage trustees