pedestrian-dag: A pedestrian implementation of directed acyclic graphs

[ bsd3, data, data-structures, library ] [ Propose Tags ]

The library implements a pedestrian representation of directed acyclic graphs.


[Index] [Quick Jump]


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'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 0.2.0
Dependencies array (>=0.5 && <0.6), base (>=4.8 && <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
Revised Revision 1 made by HerbertValerioRiedel at 2019-01-12T21:30:35Z
Category Data, Data Structures
Home page
Source repo head: git clone
Uploaded by JakubWaszczuk at 2018-09-19T14:17:59Z
Reverse Dependencies 4 direct, 2 indirect [details]
Downloads 939 total (6 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-09-19 [all 1 reports]