The graphs package

[Tags: bsd3, library]

A simple monadic graph library


[Skip to ReadMe]

Properties

Versions0.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
Change logCHANGELOG.markdown
Dependenciesarray (>=0.3 && <0.7), base (==4.*), containers (>=0.3 && <0.6), transformers (>=0.2.2 && <0.5), void (>=0.5.5.1 && <1) [details]
LicenseBSD3
CopyrightCopyright (C) 2011-2013 Edward A. Kmett
AuthorEdward A. Kmett
MaintainerEdward A. Kmett <ekmett@gmail.com>
Stabilityexperimental
CategoryAlgorithms, Data Structures, Graphs
Home pagehttp://github.com/ekmett/graphs
Bug trackerhttp://github.com/ekmett/graphs/issues
Source repositoryhead: git clone git://github.com/ekmett/graphs.git
UploadedSat Jan 10 22:10:35 UTC 2015 by EdwardKmett
DistributionsLTSHaskell:0.6.0.1, Stackage:0.6.0.1
Downloads2481 total (118 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Last success reported on 2015-01-11 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for graphs-0.6.0.1

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 irc.freenode.net.

-Edward Kmett