This provides a “not-very-Haskelly” API for calculating traversals of graphs that may be too large to fit into memory.
Contributions and bug reports are welcome!
Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.
- Add a
- Build warning-free on GHC 7.10 and GHC 8.0-rc1
- Fixed the
exitVertexorder, they were wrong before.
- Factored out a common visitor model for both
- Added CHANGELOG
- Removed my intra-package dependency upper bounds