Documentation
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
AcyclicSCC vertex | |
CyclicSCC [vertex] |
Functor SCC | |
Outputable a => Outputable (SCC a) |
flattenSCC :: SCC a -> [a]Source
flattenSCCs :: [SCC a] -> [a]Source
stronglyConnCompG :: Graph node -> [SCC node]Source
topologicalSortG :: Graph node -> [node]Source
hasVertexG :: Graph node -> node -> BoolSource
reachableG :: Graph node -> node -> [node]Source
transposeG :: Graph node -> Graph nodeSource
outdegreeG :: Graph node -> node -> Maybe IntSource
vertexGroupsG :: Graph node -> [[node]]Source
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
components :: IntGraph -> Forest VertexSource
undirected :: IntGraph -> IntGraphSource