monad-dijkstra: A monad transformer for weighted graph searches
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:
- These packages miss upper bounds: - hspec - tasty - tasty-hspec Please add them, using `cabal gen-bounds` for suggestions. For more information see: https://pvp.haskell.org/
A monad transformer for weighted graph searches using Dijkstra's or A* algorithm.
Properties
| Versions | 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.1.4, 0.1.1.4, 0.1.1.5 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.7 && <5), containers (>=0.5.6.2 && <0.7), free (>=4.12.0 && <5.3), mtl (>=2.2.0 && <2.4), psqueues (>=0.2.0.0 && <0.3), transformers (>=0.4.2.0 && <0.7) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2016-2023 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 2023-08-11T21:29:17Z |
Modules
[Index] [Quick Jump]
- Control
- Monad
Downloads
- monad-dijkstra-0.1.1.4.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees