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

type Vertex = Int Source

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

buildG :: Bounds -> [Edge] -> Graph Source

transposeG :: Graph -> Graph Source

reverseE :: Graph -> [Edge]Source

outdegree :: Graph -> Table Int Source

indegree :: Graph -> Table Int Source

data Tree a Source

Constructors

Node a (Forest a)

Instances

Show a => Show (Tree a)

type Forest a = [Tree a]Source

showTree :: Show a => Tree a -> String Source

showForest :: Show a => Forest a -> String Source

dfs :: Graph -> [Vertex] -> Forest Vertex Source

dff :: Graph -> Forest Vertex Source

topSort :: Graph -> [Vertex]Source

components :: Graph -> Forest Vertex Source

scc :: Graph -> Forest Vertex Source

back :: Graph -> Table Int -> Graph Source

cross :: Graph -> Table Int -> Table Int -> Graph Source

forward :: Graph -> Graph -> Table Int -> Graph Source

reachable :: Graph -> Vertex -> [Vertex]Source

path :: Graph -> Vertex -> Vertex -> Bool Source

bcc :: Graph -> Forest [Vertex]Source