-- Initial graph-matchings.cabal generated by cabal init. For further -- documentation, see http://haskell.org/cabal/users-guide/ -- The name of the package. name: graph-matchings -- The package version. See the Haskell package versioning policy (PVP) -- for standards guiding when and how versions should be incremented. -- http://www.haskell.org/haskellwiki/Package_versioning_policy -- PVP summary: +-+------- breaking API changes -- | | +----- non-breaking API additions -- | | | +--- code changes with no API change version: 0.1.0.0 -- A short (one-line) description of the package. synopsis: An implementation of algorithms for matchings in graphs -- A longer description of the package. description: This package provides algorithms on matchings in graphs; in particular, determining whether a given set of edges is a (maximal/maximum) matching and finding maximal/maximum matchings. -- The license under which the package is released. license: LGPL-2.1 -- The file containing the license text. license-file: LICENSE -- The package author(s). author: Manuel Eberl -- An email address to which users can send suggestions, bug reports, and -- patches. maintainer: last name + m _at_ in.tum.de -- A copyright notice. -- copyright: category: Data Structures, Graphs 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.10 library -- Modules exported by the library. exposed-modules: Data.Graph.Inductive.Query.Matchings -- Modules included in this library but not exported. -- other-modules: Test -- LANGUAGE extensions used by modules in this package. other-extensions: ScopedTypeVariables -- Other library packages from which modules are imported. build-depends: base >=3 && <5, containers >= 0.5 && < 0.6, fgl >= 5.4 && < 5.6 -- Directories containing source files. -- hs-source-dirs: -- Base language which the package is written in. default-language: Haskell2010