graph-visit: Graph walk abstraction
Walk over a graph, abstracting away from the underlying representation, not caring about precise order
Downloads
- graph-visit-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.1.0.1, 0.1.0.2 |
|---|---|
| Dependencies | base (>=4 && <5), containers (>=0.4 && <0.5), data-lens (>=2 && <3), data-lens-template (>=2 && <3), mtl (>=2 && <3) [details] |
| License | BSD-3-Clause |
| Copyright | Utrecht University, Department of Information and Computing Sciences, Software Technology group |
| Author | Atze Dijkstra |
| Maintainer | atze@uu.nl |
| Category | Development |
| Home page | https://github.com/atzedijkstra/graph-visit |
| Bug tracker | https://github.com/atzedijkstra/graph-visit/issues |
| Source repo | head: git clone git://github.com/atzedijkstra/graph-visit.git |
| Uploaded | by AtzeDijkstra at 2012-10-05T08:41:12Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 2963 total (3 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |