Data.Graph.Algorithms.DFS

Contents

• Depth-first search
• Depth-first forests
• Derived
• Topsort

Synopsis

• xdfsWith :: forall gr c. (InspectableGraph gr, VertexListGraph gr) => (Context gr -> [Vertex]) -> (Context gr -> c) -> [Vertex] -> gr -> [c]
• dfsWith :: (VertexListGraph gr, InspectableGraph gr) => (Context gr -> c) -> [Vertex] -> gr -> [c]
• dfsWith' :: (VertexListGraph gr, InspectableGraph gr) => (Context gr -> c) -> gr -> [c]
• dfs :: (VertexListGraph gr, InspectableGraph gr) => [Vertex] -> gr -> [Vertex]
• dfs' :: (VertexListGraph gr, InspectableGraph gr) => gr -> [Vertex]
• udfs :: (VertexListGraph gr, BidirectionalGraph gr, InspectableGraph gr) => [Vertex] -> gr -> [Vertex]
• udfs' :: (VertexListGraph gr, BidirectionalGraph gr, InspectableGraph gr) => gr -> [Vertex]
• rdfs :: (VertexListGraph gr, BidirectionalGraph gr, InspectableGraph gr) => [Vertex] -> gr -> [Vertex]
• rdfs' :: (BidirectionalGraph gr, VertexListGraph gr, InspectableGraph gr) => gr -> [Vertex]
• xdffWith :: DecomposableGraph gr => (Context gr -> [Vertex]) -> (Context gr -> c) -> [Vertex] -> gr -> [Tree c]
• dffWith :: DecomposableGraph gr => (Context gr -> c) -> [Vertex] -> gr -> [Tree c]
• dffWith' :: (DecomposableGraph gr, VertexListGraph gr) => (Context gr -> c) -> gr -> [Tree c]
• dff :: DecomposableGraph gr => [Vertex] -> gr -> [Tree Vertex]
• dff' :: (DecomposableGraph gr, VertexListGraph gr) => gr -> [Tree Vertex]
• udff :: (DecomposableGraph gr, BidirectionalGraph gr) => [Vertex] -> gr -> [Tree Vertex]
• udff' :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> [Tree Vertex]
• rdff :: (DecomposableGraph gr, BidirectionalGraph gr) => [Vertex] -> gr -> [Tree Vertex]
• rdff' :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> [Tree Vertex]
• components :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> [[Vertex]]
• noComponents :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> Int
• isConnected :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> Bool
• topsort :: (DecomposableGraph gr, VertexListGraph gr) => gr -> [Vertex]
• topsort' :: (DecomposableGraph gr, VertexListGraph gr) => gr -> [VertexLabel gr]
• scc :: (DecomposableGraph gr, BidirectionalGraph gr, VertexListGraph gr) => gr -> [[Vertex]]
• reachable :: DecomposableGraph gr => Vertex -> gr -> [Vertex]

Depth-first search

Depth-first forests

Derived

Topsort