graphs: A simple monadic graph library
Modules
[Index]
Downloads
- graphs-0.5.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.2, 0.3, 0.3.1, 0.3.2, 0.3.2.1, 0.3.2.2, 0.3.2.3, 0.4, 0.4.0.1, 0.4.0.3, 0.4.1, 0.5, 0.5.0.1, 0.6, 0.6.0.1, 0.7, 0.7.1, 0.7.2, 0.7.3 |
|---|---|
| Change log | CHANGELOG.markdown |
| Dependencies | array (>=0.3 && <0.6), base (>=4 && <5), containers (>=0.3 && <0.6), transformers (>=0.2.2 && <0.4), void (>=0.5.5.1 && <1) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (C) 2011-2013 Edward A. Kmett |
| Author | Edward A. Kmett |
| Maintainer | Edward A. Kmett <ekmett@gmail.com> |
| Uploaded | by EdwardKmett at 2013-10-13T14:52:20Z |
| Category | Algorithms, Data Structures, Graphs |
| Home page | http://github.com/ekmett/graphs |
| Bug tracker | http://github.com/ekmett/graphs/issues |
| Source repo | head: git clone git://github.com/ekmett/graphs.git |
| Distributions | LTSHaskell:0.7.3, NixOS:0.7.3, Stackage:0.7.3 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 15397 total (42 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |
Readme for graphs-0.5.0.1
[back to package description]graphs
This provides a "not-very-Haskelly" API for calculating traversals of graphs that may be too large to fit into memory.
Contact Information
Contributions and bug reports are welcome!
Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.
-Edward Kmett