pedestrian-dag: A pedestrian implementation of directed acyclic graphs
The library implements a pedestrian representation of directed acyclic graphs.
|Dependencies||array (==0.5.*), base (>=4.8 && <5), binary (>=0.7 && <0.9), containers (>=0.4 && <0.6) [details]|
|Copyright||Copyright (c) 2013-2018 Jakub Waszczuk|
|Revised||Revision 1 made by HerbertValerioRiedel at 2019-01-12T21:30:35Z|
|Category||Data, Data Structures|
|Source repo||head: git clone https://github.com/kawu/pedestrian-dag.git|
|Uploaded||by JakubWaszczuk at 2018-09-19T14:17:59Z|
|Downloads||616 total (3 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2018-09-19 [all 1 reports]
- pedestrian-dag-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees