fgl-5.5.3.0: Martin Erwig's Functional Graph Library

Safe Haskell | Safe
Language | Haskell98

Data.Graph.Inductive.Tree

Description

Tree-based implementation of `Graph` and `DynGraph`

You will probably have better performance using the Data.Graph.Inductive.PatriciaTree implementation instead.

# Documentation

data Gr a b #

Instances

Bifunctor Gr # |
Methods bimap :: (a -> b) -> (c -> d) -> Gr a c -> Gr b d # first :: (a -> b) -> Gr a c -> Gr b c # second :: (b -> c) -> Gr a b -> Gr a c #
DynGraph Gr # |
Methods (&) :: Context a b -> Gr a b -> Gr a b #
Graph Gr # |
Methods empty :: Gr a b # isEmpty :: Gr a b -> Bool # match :: Node -> Gr a b -> Decomp Gr a b # mkGraph :: [LNode a] -> [LEdge b] -> Gr a b # labNodes :: Gr a b -> [LNode a] # matchAny :: Gr a b -> GDecomp Gr a b # noNodes :: Gr a b -> Int # nodeRange :: Gr a b -> (Node, Node) # labEdges :: Gr a b -> [LEdge b] #
(Eq a, Ord b) => Eq (Gr a b) # |
Methods (==) :: Gr a b -> Gr a b -> Bool # (/=) :: Gr a b -> Gr a b -> Bool #
(Read a, Read b) => Read (Gr a b) # |
Methods readsPrec :: Int -> ReadS (Gr a b) # readList :: ReadS [Gr a b] # readPrec :: ReadPrec (Gr a b) # readListPrec :: ReadPrec [Gr a b] #
(Show a, Show b) => Show (Gr a b) # |
Methods showsPrec :: Int -> Gr a b -> ShowS # show :: Gr a b -> String # showList :: [Gr a b] -> ShowS #
Generic (Gr a b) # |
Associated Types type Rep (Gr a b) :: * -> * # Methods from :: Gr a b -> Rep (Gr a b) x # to :: Rep (Gr a b) x -> Gr a b #
(NFData a, NFData b) => NFData (Gr a b) # |
Methods rnf :: Gr a b -> () #
type Rep (Gr a b) # |
type Rep (Gr a b)

type UGr = Gr () () #