BSD-3-Clause licensed by Edward A. Kmett
Maintained by Edward A. Kmett

Module documentation for 0.5.0.1

This version can be pinned in stack with:[email protected]:f9e93ebd1dc63c57d6f0eebabf8d9d36abbc9c3980be077d84e33e92cee24334,1467
  • 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

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.5

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

0.4.1

  • Added CHANGELOG
  • Removed my intra-package dependency upper bounds