Package5.8.3.1Data StructuresGraphs
fgl
Martin Erwig's Functional Graph Library
- Version5.8.3.1
- CategoryData Structures, Graphs
- LicenceBSD-3-Clause
- AuthorMartin Erwig, Ivan Lazar Miljenovic
- Maintainerathas@sigkill.dk
- Pinned byhackage fgl 5.8.3.1
- Sourcehackage.haskell.org/package/fgl-5.8.3.1
Modules
- Data.Graph.Inductive
- Data.Graph.Inductive.BasicBasic Graph Algorithms
- Data.Graph.Inductive.ExampleExample Graphs
- Data.Graph.Inductive.GraphStatic and Dynamic Inductive Graphs
- Data.Graph.Inductive.MonadMonadic Graphs
- Data.Graph.Inductive.Monad.IOArrayStatic IOArray-based Graphs
- Data.Graph.Inductive.Monad.STArrayStatic IOArray-based Graphs
- Data.Graph.Inductive.NodeMapUtility methods to automatically generate and keep track of a mapping
- Data.Graph.Inductive.PatriciaTreeAn efficient implementation of Graph
- Data.Graph.Inductive.Query
- Data.Graph.Inductive.Query.ArtPoint
- Data.Graph.Inductive.Query.BCC
- Data.Graph.Inductive.Query.BFSBreadth-First Search Algorithms
- Data.Graph.Inductive.Query.DFSDepth-first search algorithms. Names consist of: An optional direction parameter, specifying which nodes to visit next. u undirectional: …
- Data.Graph.Inductive.Query.Dominators
- Data.Graph.Inductive.Query.GVDGraph Voronoi Diagram These functions can be used to create a shortest path forest
- Data.Graph.Inductive.Query.IndepMaximum Independent Node Sets
- Data.Graph.Inductive.Query.MSTMinimum-Spanning-Tree Algorithms
- Data.Graph.Inductive.Query.MaxFlowMaximum Flow algorithm We are given a flow network G=(V,E) with source s and sink t
- Data.Graph.Inductive.Query.MaxFlow2Alternative Maximum Flow
- Data.Graph.Inductive.Query.MonadMonadic Graph Algorithms
- Data.Graph.Inductive.Query.SPShortest path algorithms
- Data.Graph.Inductive.Query.TransClos
- Data.Graph.Inductive.TreeTree-based implementation of Graph and DynGraph You will probably have better performance using the
Internal modules · 4
- Data.Graph.Inductive.Internal.HeapPairing heap implementation of dictionary
- Data.Graph.Inductive.Internal.Queue
- Data.Graph.Inductive.Internal.RootPathInward directed trees as lists of paths.
- Data.Graph.Inductive.Internal.ThreadThreading Combinators.
Description
An inductive representation of manipulating graph data structures.
Original website can be found at http://web.engr.oregonstate.edu/~erwig/fgl/haskell.
Depends on
5 packages- array-0.5.8.0with GHC
- base-4.23.0.0with GHC
- containers-0.8with GHC
- deepseq-1.5.2.0with GHC
- transformers-0.6.3.0with GHC