fgl

Martin Erwig's Functional Graph Library

LTS Haskell 24.28:5.8.3.0@rev:2
Stackage Nightly 2026-01-18:5.8.3.0@rev:2
Latest on Hackage:5.8.3.0@rev:2

See all snapshots fgl appears in

BSD-3-Clause licensed by Martin Erwig, Ivan Lazar Miljenovic
Maintained by [email protected]
This version can be pinned in stack with:fgl-5.8.3.0@sha256:a928ad5225ec6b85963ac9fd7a920416aea979155a3b88fad08a85bbcb68d9eb,3976

Module documentation for 5.8.3.0

  • Data
    • Data.Graph
      • Data.Graph.Inductive
        • Data.Graph.Inductive.Basic
        • Data.Graph.Inductive.Example
        • Data.Graph.Inductive.Graph
        • Data.Graph.Inductive.Internal
          • Data.Graph.Inductive.Internal.Heap
          • Data.Graph.Inductive.Internal.Queue
          • Data.Graph.Inductive.Internal.RootPath
          • Data.Graph.Inductive.Internal.Thread
        • Data.Graph.Inductive.Monad
          • Data.Graph.Inductive.Monad.IOArray
          • Data.Graph.Inductive.Monad.STArray
        • Data.Graph.Inductive.NodeMap
        • Data.Graph.Inductive.PatriciaTree
        • Data.Graph.Inductive.Query
          • Data.Graph.Inductive.Query.ArtPoint
          • Data.Graph.Inductive.Query.BCC
          • Data.Graph.Inductive.Query.BFS
          • Data.Graph.Inductive.Query.DFS
          • Data.Graph.Inductive.Query.Dominators
          • Data.Graph.Inductive.Query.GVD
          • Data.Graph.Inductive.Query.Indep
          • Data.Graph.Inductive.Query.MST
          • Data.Graph.Inductive.Query.MaxFlow
          • Data.Graph.Inductive.Query.MaxFlow2
          • Data.Graph.Inductive.Query.Monad
          • Data.Graph.Inductive.Query.SP
          • Data.Graph.Inductive.Query.TransClos
        • Data.Graph.Inductive.Tree
Depends on 5 packages(full list with versions):

An inductive representation of manipulating graph data structures.

Original website can be found at http://web.engr.oregonstate.edu/~erwig/fgl/haskell.

Now without braces in cabal file.