The graphs package

[Tags: bsd3, library]

A simple monadic graph library

[Skip to ReadMe]


Versions0.1, 0.2, 0.3, 0.3.1, 0.3.2,,,, 0.4,,, 0.4.1, 0.5,, 0.6,
Change logCHANGELOG.markdown
Dependenciesarray (>=0.3 && <0.7), base (==4.*), containers (>=0.3 && <0.6), transformers (>=0.2.2 && <0.5), void (>= && <1) [details]
CopyrightCopyright (C) 2011-2013 Edward A. Kmett
AuthorEdward A. Kmett
MaintainerEdward A. Kmett <>
CategoryAlgorithms, Data Structures, Graphs
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedSat Jan 10 22:10:35 UTC 2015 by EdwardKmett
DistributionsLTSHaskell:, NixOS:, Stackage:
Downloads2735 total (72 in last 30 days)
0 []
StatusDocs available [build log]
Last success reported on 2015-01-11 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees

Readme for graphs-


Build Status

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

-Edward Kmett