homepage: https://github.com/ennocramer/monad-dijkstra
changelog-type: ''
hash: 5674368ae8c70d0187adc385a4de0bb743cfbeba9f40a63bafc9b122461ce6b9
test-bench-deps:
  monad-dijkstra: -any
  hlint: ==1.*
  base: ! '>=4.7 && <5'
  tasty-hspec: -any
  tasty: -any
maintainer: Enno Cramer <ecramer@memfrob.de>
synopsis: Monad transformer for weighted graph searches using Dijkstra's or A* algorithm
changelog: ''
basic-deps:
  free: ! '>=4.12.0 && <4.13'
  base: ! '>=4.7 && <5'
  mtl: ! '>=2.2.0 && <2.3'
  transformers: ! '>=0.4.2.0 && <0.5.3'
  psqueues: ! '>=0.2.0.0 && <0.2.3'
all-versions:
- '0.1.0.0'
author: Enno Cramer
latest: '0.1.0.0'
description-type: haddock
description: Please see README.md
license-name: BSD3

homepage: https://github.com/ennocramer/monad-dijkstra
changelog-type: ''
hash: 83a4f53dbc83b0a3d4c8148cb8940f8d7eae7890ee568227c29eb537f2bf7c06
test-bench-deps:
  monad-dijkstra: -any
  hlint: ==1.*
  base: ! '>=4.7 && <5'
  tasty-hspec: -any
  tasty: -any
maintainer: Enno Cramer <ecramer@memfrob.de>
synopsis: Monad transformer for weighted graph searches using Dijkstra's or A* algorithm
changelog: ''
basic-deps:
  free: ! '>=4.12.0 && <4.13'
  base: ! '>=4.7 && <5'
  mtl: ! '>=2.2.0 && <2.3'
  transformers: ! '>=0.4.2.0 && <0.5.3'
  psqueues: ! '>=0.2.0.0 && <0.2.3'
all-versions:
- '0.1.0.0'
- '0.1.1.0'
author: Enno Cramer
latest: '0.1.1.0'
description-type: haddock
description: Please see README.md
license-name: BSD3

Update from Hackage at 2017-06-28T13:46:09Z
Update from Hackage at 2017-06-28T13:46:09Z
