pedestrian-dag: A pedestrian implementation of directed acyclic graphs
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.
The library implements a pedestrian representation of directed acyclic graphs.
Properties
| Versions | 0.2.0, 0.2.0 |
|---|---|
| Change log | None available |
| Dependencies | array (>=0.5 && <0.6), base (>=4 && <5), binary (>=0.7 && <0.9), containers (>=0.4 && <0.6) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2013-2018 Jakub Waszczuk |
| Author | Jakub Waszczuk |
| Maintainer | waszczuk.kuba@gmail.com |
| Category | Data, Data Structures |
| Home page | https://github.com/kawu/pedestrian-dag |
| Source repo | head: git clone https://github.com/kawu/pedestrian-dag.git |
| Uploaded | by JakubWaszczuk at 2018-09-19T14:15:50Z |
Modules
[Index] [Quick Jump]
- Data
Downloads
- pedestrian-dag-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees