homepage: ''
changelog-type: ''
hash: f4e154bfdc0a7175a24b43288ae5427bbd6b66374f9ba7753e84f89c3e60eadc
test-bench-deps: {}
maintainer: Matt Morrow <morrow@moonpatio.com>
synopsis: The Lengauer-Tarjan graph dominators algorithm.
changelog: ''
basic-deps:
  base: ==4.*
  array: <0.6
  containers: <0.6
all-versions:
- 0.1.0
- 0.1.1
- 0.1.2
- 0.1.3
author: Matt Morrow
latest: 0.1.3
description-type: haddock
description: .
license-name: BSD-3-Clause

homepage: ''
changelog-type: markdown
hash: 20584f20426244889db69b86f6916e9e6e171fa13a2164240fd33a84f958f88c
test-bench-deps:
  base: -any
  dom-lt: -any
  criterion: ! '>=1.4'
  containers: -any
  deepseq: -any
maintainer: Andreas Klebinger <klebinger.andreas@gmx.at>
synopsis: The Lengauer-Tarjan graph dominators algorithm.
changelog: "Changes in version 0.2.0\r\n\r\n* Better performance!\r\n* Major bump
  because of strictness changes.\r\n* Functions are now slightly stricter.\r\n  In
  the past the successor list of nodes unreachable from the root wasn't evaluated.\r\n
  \ This is no longer the case and they will be evaluated.\r\n  Moving forward users
  should expect all inputs to be evaluated unless stated otherwise.\r\n* Requires
  GHC >= 8.0 to build (base dependency)\r\n* Requires containers >= 0.5\r\n* Exchanged
  the deprecated container functions with their replacements.\r\n* Replaced a few
  right folds with strict left folds.\r\n* Commented out/removed some unused code.\r\n*
  Replaced mapsnd and swap with variants from base.\r\n* Add very simplistic benchmark/test
  suites."
basic-deps:
  base: ! '>=4.9 && <5'
  array: -any
  containers: ! '>=0.5'
all-versions:
- 0.1.0
- 0.1.1
- 0.1.2
- 0.1.3
- 0.2.0
author: Matt Morrow
latest: 0.2.0
description-type: haddock
description: |-
  The Lengauer-Tarjan graph dominators algorithm.
  Included are ways to compute domination and post-domination relationships.
license-name: BSD-3-Clause

Update from Hackage at 2019-03-19T19:02:41Z
Update from Hackage at 2019-03-19T19:02:41Z
