graph-visit: Graph walk abstraction

[ bsd3, development, library ] [ Propose Tags ]

Walk over a graph, abstracting away from the underlying representation, not caring about precise order

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

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), data-lens (>=2), data-lens-template (>=2), mtl (>=2) [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 2013-07-24T11:47:01Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2885 total (10 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]