ghc-6.12.2: The GHC APISource codeContentsIndex
Digraph
Documentation
data Graph node Source
show/hide Instances
Outputable node => Outputable (Graph node)
graphFromVerticesAndAdjacency :: Ord key => [(node, key)] -> [(key, key)] -> Graph (node, key)Source
graphFromEdgedVertices :: Ord key => [(node, key, [key])] -> Graph (node, key, [key])Source
data SCC vertex Source
Constructors
AcyclicSCC vertex
CyclicSCC [vertex]
show/hide Instances
flattenSCC :: SCC a -> [a]Source
flattenSCCs :: [SCC a] -> [a]Source
stronglyConnCompG :: Graph node -> [SCC node]Source
topologicalSortG :: Graph node -> [node]Source
verticesG :: Graph node -> [node]Source
edgesG :: Graph node -> [Edge node]Source
hasVertexG :: Graph node -> node -> BoolSource
reachableG :: Graph node -> node -> [node]Source
transposeG :: Graph node -> Graph nodeSource
outdegreeG :: Graph node -> node -> Maybe IntSource
indegreeG :: Graph node -> node -> Maybe IntSource
vertexGroupsG :: Graph node -> [[node]]Source
emptyG :: Graph node -> BoolSource
componentsG :: Graph node -> [[node]]Source
stronglyConnCompFromEdgedVertices :: Ord key => [(node, key, [key])] -> [SCC node]Source
stronglyConnCompFromEdgedVerticesR :: Ord key => [(node, key, [key])] -> [SCC (node, key, [key])]Source
tabulate :: Bounds -> [Vertex] -> Table IntSource
preArr :: Bounds -> Forest Vertex -> Table IntSource
components :: IntGraph -> Forest VertexSource
undirected :: IntGraph -> IntGraphSource
back :: IntGraph -> Table Int -> IntGraphSource
cross :: IntGraph -> Table Int -> Table Int -> IntGraphSource
forward :: IntGraph -> IntGraph -> Table Int -> IntGraphSource
path :: IntGraph -> Vertex -> Vertex -> BoolSource
bcc :: IntGraph -> Forest [Vertex]Source
do_label :: IntGraph -> Table Int -> Tree Vertex -> Tree (Vertex, Int, Int)Source
bicomps :: Tree (Vertex, Int, Int) -> Forest [Vertex]Source
collect :: Tree (Vertex, Int, Int) -> (Int, Tree [Vertex])Source
Produced by Haddock version 2.6.1