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
28 modules- Data.Graph.Inductive1
- Data.Graph.Inductive.Basic13Basic Graph Algorithms
- Data.Graph.Inductive.Example51Example Graphs
- Data.Graph.Inductive.Graph85Static and Dynamic Inductive Graphs
- Data.Graph.Inductive.Monad10Monadic Graphs
- Data.Graph.Inductive.Monad.IOArray7Static IOArray-based Graphs
- Data.Graph.Inductive.Monad.STArray7Static IOArray-based Graphs
- Data.Graph.Inductive.NodeMap39Utility methods to automatically generate and keep track of a mapping
- Data.Graph.Inductive.PatriciaTree2An efficient implementation of Graph
- Data.Graph.Inductive.Query0
- Data.Graph.Inductive.Query.ArtPoint1
- Data.Graph.Inductive.Query.BCC1
- Data.Graph.Inductive.Query.BFS13Breadth-First Search Algorithms
- Data.Graph.Inductive.Query.DFS32Depth-first search algorithms. Names consist of: An optional direction parameter, specifying which nodes to visit next. u undirectional: …
- Data.Graph.Inductive.Query.Dominators2
- Data.Graph.Inductive.Query.GVD8Graph Voronoi Diagram These functions can be used to create a shortest path forest
- Data.Graph.Inductive.Query.Indep2Maximum Independent Node Sets
- Data.Graph.Inductive.Query.MST4Minimum-Spanning-Tree Algorithms
- Data.Graph.Inductive.Query.MaxFlow8Maximum Flow algorithm We are given a flow network G=(V,E) with source s and sink t
- Data.Graph.Inductive.Query.MaxFlow24Alternative Maximum Flow
- Data.Graph.Inductive.Query.Monad34Monadic Graph Algorithms
- Data.Graph.Inductive.Query.SP6Shortest path algorithms
- Data.Graph.Inductive.Query.TransClos3
- Data.Graph.Inductive.Tree2Tree-based implementation of Graph and DynGraph You will probably have better performance using the
Internal modules · 4
- Data.Graph.Inductive.Internal.Heap15Pairing heap implementation of dictionary
- Data.Graph.Inductive.Internal.Queue6
- Data.Graph.Inductive.Internal.RootPath6Inward directed trees as lists of paths.
- Data.Graph.Inductive.Internal.Thread10Threading 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