homepage: https://github.com/choener/ShortestPathProblems
changelog-type: markdown
hash: cc8694231cdab28760a6184bb4452449cd7df374c272dc04f865c6a185b43255
test-bench-deps:
  tasty-th: ! '>=0.1'
  base: -any
  ShortestPathProblems: -any
  tasty-quickcheck: ! '>=0.8'
  tasty: ! '>=0.11'
  QuickCheck: -any
  vector: -any
maintainer: choener@bioinf.uni-leipzig.de
synopsis: grammars for TSP and SHP
changelog: ! '0.0.0.1

  -------


  - initial checkin


'
basic-deps:
  base: ! '>=4.7 && <5.0'
  ADPfusion: ==0.5.2.*
  text: ! '>=1.0'
  PrimitiveArray: ==0.8.0.*
  log-domain: ! '>=0.11'
  ADPfusionSet: ==0.0.0.*
  FormalGrammars: ==0.3.1.*
  vector: ! '>=0.10'
all-versions:
- '0.0.0.1'
author: Christian Hoener zu Siederdissen, 2016
latest: '0.0.0.1'
description-type: markdown
description: ! "[![Build Status](https://travis-ci.org/choener/ShortestPathProblems.svg?branch=master)](https://travis-ci.org/choener/ShortestPathProblems)\n\n#
  ShortestPathProblems\n\nGrammars for shortest Hamiltonian path and Travelling Salesman
  problems.\n\n\n\n#### Contact\n\nChristian Hoener zu Siederdissen  \nLeipzig University,
  Leipzig, Germany  \nchoener@bioinf.uni-leipzig.de  \nhttp://www.bioinf.uni-leipzig.de/~choener/
  \ \n\n"
license-name: BSD3

Update from Hackage at 2017-03-06T20:09:01Z
Update from Hackage at 2017-03-06T20:09:01Z
