monad-dijkstra: Monad transformer for weighted graph searches using Dijkstra's or A* algorithm
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- The 'description' field should be longer than the 'synopsis' field. It's useful to provide an informative 'description' to allow Haskell programmers who have never heard about your package to understand the purpose of your package. The 'description' field content is typically shown by tooling (e.g. 'cabal info', Haddock, Hackage) below the 'synopsis' which serves as a headline. Please refer to <https://www.haskell.org/cabal/users-guide/developing-packages.html#package-properties> for more details.
Please see README.md
Properties
| Versions | 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.1.4, 0.1.1.5 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.7 && <5), free (>=4.12.0 && <5.2), mtl (>=2.2.0 && <2.3), psqueues (>=0.2.0.0 && <0.2.8), transformers (>=0.4.2.0 && <0.5.6) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2016 Enno Cramer |
| Author | Enno Cramer |
| Maintainer | Enno Cramer <ecramer@memfrob.de> |
| Category | Control, Monads |
| Home page | https://github.com/ennocramer/monad-dijkstra |
| Source repo | head: git clone https://github.com/ennocramer/monad-dijkstra |
| Uploaded | by ecramer at 2018-12-11T13:59:35Z |
Modules
[Index] [Quick Jump]
- Control
- Monad
Downloads
- monad-dijkstra-0.1.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees