maximal-cliques-0.1: maximal-cliques.cabal

-- maximal-cliques.cabal auto-generated by cabal init. For additional
-- options, see
-- http://www.haskell.org/cabal/release/cabal-latest/doc/users-guide/authors.html#pkg-descr.
-- The name of the package.
Name:                maximal-cliques

-- The package version. See the Haskell package versioning policy
-- (http://www.haskell.org/haskellwiki/Package_versioning_policy) for
-- standards guiding when and how versions should be incremented.
Version:             0.1

-- A short (one-line) description of the package.
Synopsis:            Enumerate all maximal cliques of a graph.

-- A longer description of the package.
Description:         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.

-- The license under which the package is released.
License:             BSD3

-- The file containing the license text.
License-file:        LICENSE

-- The package author(s).
Author:              Gershom Bazerman

-- An email address to which users can send suggestions, bug reports,
-- and patches.
Maintainer:          gershomb@gmail.com

-- A copyright notice.
-- Copyright:

Category:            Algorithms

Build-type:          Simple

-- Extra files to be distributed with the package, such as examples or
-- a README.
-- Extra-source-files:

-- Constraint on the version of Cabal needed to build this package.
Cabal-version:       >=1.2


Library
  -- Modules exported by the library.
  Exposed-modules: Data.Algorithm.MaximalCliques

  -- Packages needed in order to build this package.
  Build-depends:   base > 3, base < 5, containers, vector

  ghc-options:     -Wall

  -- Modules not exported by this package.
  -- Other-modules:

  -- Extra tools (e.g. alex, hsc2hs, ...) needed to build the source.
  -- Build-tools: