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

- No changelog available

## Properties

Version | 0.1 |
---|---|

Dependencies | base (>3 && <5), containers, vector |

License | BSD3 |

Author | Gershom Bazerman |

Maintainer | gershomb@gmail.com |

Category | Algorithms |

Upload date | Mon Dec 20 21:20:12 UTC 2010 |

Uploaded by | GershomBazerman |

Downloads | 137 total (11 in last 30 days) |

## 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