The graphs package

[ Tags: algorithms, bsd3, data-structures, graphs, library ] [ Propose Tags ]

A simple monadic graph library


[Skip to Readme]

Properties

Versions 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
Change log CHANGELOG.markdown
Dependencies array (>=0.3 && <0.5), base (==4.*), containers (>=0.3 && <0.6), transformers (>=0.2.2 && <0.4), void (>=0.5.5.1) [details]
License BSD3
Copyright Copyright (C) 2011-2013 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Category Algorithms, Data Structures, Graphs
Home page http://github.com/ekmett/graphs
Bug tracker http://github.com/ekmett/graphs/issues
Source repository head: git clone git://github.com/ekmett/graphs.git
Uploaded Thu Sep 5 13:53:26 UTC 2013 by EdwardKmett
Distributions LTSHaskell:0.7, NixOS:0.7, Stackage:0.7, Tumbleweed:0.7
Downloads 3972 total (64 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for graphs-0.5

[back to package description]

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