Safe Haskell  None 

Language  Haskell98 
Exposes things that are considered to be too unstable for inclusion in the exports of Data.Graph.Wrapper.
Use of this module should be avoided as it will change frequently and changes to this module alone will not necessarily follow the Package Versioning Policy.
Synopsis
 type Edge i = (i, i)
 data Graph i v = G {
 graph :: Graph
 indexGVertexArray :: Array Vertex i
 gVertexVertexArray :: Array Vertex v
 traverseWithKey :: Applicative t => (i > a > t b) > Graph i a > t (Graph i b)
 indexGVertex :: Ord i => Graph i v > i > Vertex
 gVertexIndex :: Graph i v > Vertex > i
 gVertexVertex :: Graph i v > Vertex > v
 vertex :: Ord i => Graph i v > i > v
 indexGVertex' :: Ord i => Array Vertex i > i > Vertex
 indexGVertex'_maybe :: Ord i => Array Vertex i > i > Maybe Vertex
 vertices :: Graph i v > [i]
 edges :: Graph i v > [Edge i]
Documentation
A directed graph
G  

Instances
Functor (Graph i) Source #  
Foldable (Graph i) Source #  
Defined in Data.Graph.Wrapper.Internal fold :: Monoid m => Graph i m > m # foldMap :: Monoid m => (a > m) > Graph i a > m # foldr :: (a > b > b) > b > Graph i a > b # foldr' :: (a > b > b) > b > Graph i a > b # foldl :: (b > a > b) > b > Graph i a > b # foldl' :: (b > a > b) > b > Graph i a > b # foldr1 :: (a > a > a) > Graph i a > a # foldl1 :: (a > a > a) > Graph i a > a # elem :: Eq a => a > Graph i a > Bool # maximum :: Ord a => Graph i a > a # minimum :: Ord a => Graph i a > a #  
Traversable (Graph i) Source #  
(Ord i, Eq v) => Eq (Graph i v) Source #  
(Ord i, Show i, Show v) => Show (Graph i v) Source #  
traverseWithKey :: Applicative t => (i > a > t b) > Graph i a > t (Graph i b) Source #
gVertexIndex :: Graph i v > Vertex > i Source #
gVertexVertex :: Graph i v > Vertex > v Source #