graphs

A simple monadic graph library

http://github.com/ekmett/graphs

Version on this page:	0.7
LTS Haskell 23.21:	0.7.3
Stackage Nightly 2025-05-03:	0.7.3
Latest on Hackage:	0.7.3

See all snapshots graphs appears in

BSD-3-Clause licensed by Edward A. Kmett

Maintained by Edward A. Kmett

This version can be pinned in stack with:graphs-0.7@sha256:9be49c9b8be4be4bed661d7a9195dfd279d7d82ece5c53d5696b482f3ba12211,4226

Module documentation for 0.7

Data
- Data.Graph
  - Data.Graph.AdjacencyList
  - Data.Graph.AdjacencyMatrix
  - Data.Graph.Algorithm
    - Data.Graph.Algorithm.BreadthFirstSearch
    - Data.Graph.Algorithm.DepthFirstSearch
  - Data.Graph.Class
    - Data.Graph.Class.AdjacencyList
    - Data.Graph.Class.AdjacencyMatrix
    - Data.Graph.Class.Bidirectional
    - Data.Graph.Class.EdgeEnumerable
    - Data.Graph.Class.VertexEnumerable
  - Data.Graph.Dual
  - Data.Graph.PropertyMap

Depends on 6 packages(full list with versions):

array, base, containers, transformers, transformers-compat, void

graphs

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

Changes

0.7

Build warning-free on GHC 7.10 and GHC 8.0-rc1

0.6

Fixed the dfs enterVertex and exitVertex order, they were wrong before.
Factored out a common visitor model for both bfs and dfs.

0.5

Added enterEdge to bfs and dfs.
Exported AdjacencyListGraph and AdjacencyMatrixGraph.

0.4.1

Added CHANGELOG
Removed my intra-package dependency upper bounds