hdirect-0.21.0: An IDL compiler for Haskell

Digraph

Documentation

stronglyConnComp :: Ord key => [(node, key, [key])] -> [SCC node]Source

stronglyConnCompR :: Ord key => [(node, key, [key])] -> [SCC (node, key, [key])]Source

data SCC vertex Source

Constructors

AcyclicSCC vertex 
CyclicSCC [vertex] 

type Graph = Table [Vertex]Source

graphFromEdges :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]))Source

buildG :: Bounds -> [Edge] -> GraphSource

reverseE :: Graph -> [Edge]Source

data Tree a Source

Constructors

Node a (Forest a) 

Instances

Show a => Show (Tree a) 

type Forest a = [Tree a]Source

back :: Graph -> Table Int -> GraphSource

cross :: Graph -> Table Int -> Table Int -> GraphSource

forward :: Graph -> Graph -> Table Int -> GraphSource