graphs

A simple monadic graph library

http://github.com/ekmett/graphs

LTS Haskell 24.28:0.7.3
Stackage Nightly 2026-01-18: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.3@sha256:38c583161c64e6b4f1531e57243598e8a36f4d131b1e87d3254de2910bef7365,4647

Module documentation for 0.7.3

  • 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

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

Changes

0.7.3 [2025.03.03]

  • Drop support for pre-8.0 versions of GHC.

0.7.2 [2022.05.07]

  • Allow building with transformers-0.6.*.

0.7.1 [2018.02.24]

  • Add a Semigroup instance for GraphSearch.

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