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
Instances
Bifunctor Gr Source # | |
DynGraph Gr Source # | |
Graph Gr Source # | |
Defined in Data.Graph.Inductive.Tree Methods isEmpty :: Gr a b -> Bool Source # match :: Node -> Gr a b -> Decomp Gr a b Source # mkGraph :: [LNode a] -> [LEdge b] -> Gr a b Source # labNodes :: Gr a b -> [LNode a] Source # matchAny :: Gr a b -> GDecomp Gr a b Source # noNodes :: Gr a b -> Int Source # | |
(Eq a, Ord b) => Eq (Gr a b) Source # | |
(Read a, Read b) => Read (Gr a b) Source # | |
(Show a, Show b) => Show (Gr a b) Source # | |
Generic (Gr a b) Source # | |
(NFData a, NFData b) => NFData (Gr a b) Source # | |
Defined in Data.Graph.Inductive.Tree | |
type Rep (Gr a b) Source # | |
Defined in Data.Graph.Inductive.Tree |