Tree package:fgl

module Data.Graph.Inductive.Tree
fgl
Tree-based implementation of Graph and DynGraph You will probably have better performance using the Data.Graph.Inductive.PatriciaTree implementation instead.
type LRTree a = [LPath a]
fgl Data.Graph.Inductive.Internal.RootPath Data.Graph.Inductive.Query.GVD Data.Graph.Inductive.Query.MST Data.Graph.Inductive.Query.SP
type RTree = [Path]
fgl Data.Graph.Inductive.Internal.RootPath Data.Graph.Inductive.Query.BFS
module Data.Graph.Inductive.PatriciaTree
fgl
An efficient implementation of Graph using big-endian patricia tree (i.e. Data.IntMap). This module provides the following specialised functions to gain more performance, using GHC's RULES pragma:
msTree :: (Graph gr, Real b) => gr a b -> LRTree b
fgl Data.Graph.Inductive.Query.MST
msTreeAt :: (Graph gr, Real b) => Node -> gr a b -> LRTree b
fgl Data.Graph.Inductive.Query.MST
spTree :: (Graph gr, Real b) => Node -> gr a b -> LRTree b
fgl Data.Graph.Inductive.Query.SP
Tree of shortest paths from a certain node to the rest of the (reachable) nodes. Corresponds to dijkstra applied to a heap in which the only known node is the starting node, with a path of length 0 leading to it. The edge labels of type b are the edge weights; negative edge weights are not supported.