Name:                DangD
Version:             1.0.0.0
Synopsis:            Generating d-angulations of girth d.

Description:         /d/-angulations are planar graphs where every
                     face is of size /d/.  The girth of a planar graph
                     is the length of the shortest cycle in the graph.
                     This package will generate all /d/-angulations of
                     girth /d/ for any /d/ >= 3.

License:             BSD3
License-file:        LICENSE
Author:              Ivan Lazar Miljenovic
Maintainer:          Ivan.Miljenovic@gmail.com
Copyright:           Ivan Lazar Miljenovic
Category:            graphs
Build-type:          Simple
Cabal-version:       >=1.14

Source-Repository head
    type: darcs
    location: http://code.haskell.org/~ivanm/dangd

Library
  Default-Language: Haskell98

  Exposed-modules:   Math.Combinatorics.Graph.Planar.DangD
                     Math.Combinatorics.Graph.Planar.DangD.GF

  Other-modules:     Math.Combinatorics.Graph.Planar.DangD.Common

  Build-depends:     base < 5,
                     containers < 0.6,
                     planar-graph,
                     data-clist == 0.0.7.*,
                     transformers >= 0.2 && < 0.4,
                     HaskellForMaths == 0.4.*,
                     multiset-comb

  GHC-Options:       -Wall

  GHC-Prof-Options:  -prof -auto-all

Executable dangd
  Default-Language: Haskell98

  Build-Depends:    base,
                    planar-graph,
                    DangD

  hs-Source-Dirs:   utils

  Main-is:           Main.hs

  GHC-Options:       -O -Wall

  GHC-Prof-Options:  -auto-all -caf-all -rtsopts

-- Doesn't test I/O
Benchmark dangd-benchmark
  Default-Language: Haskell98

  Type:             exitcode-stdio-1.0

  Build-Depends:    base,
                    deepseq,
                    DangD,
                    criterion >= 0.5 && < 0.7

  hs-Source-Dirs:   utils

  Main-Is:          Benchmark.hs

  GHC-Options:       -O -Wall

  GHC-Prof-Options:  -auto-all -caf-all -rtsopts