Skip to content
ekmettPublic

About

a monadic graph library

Resources

Stars

39 stars

Watchers

6 watching

Forks

Repository files navigation

graphs

Hackage 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

About

a monadic graph library

Resources

Stars

39 stars

Watchers

6 watching

Forks

Releases

Packages

Used by

Contributors

Languages