Haskell Hierarchical Libraries (fgl package) Contents Index

Data.Graph.Inductive.Query.DFS

Contents Undirected DFS Reverse DFS Applications of DFS/DFF Applications of UDFS/UDFF

Description

Depth-First Search

Synopsis

type CFun a b c = Context a b -> c dfs :: Graph gr => [Node] -> gr a b -> [Node] dfs' :: Graph gr => gr a b -> [Node] dff :: Graph gr => [Node] -> gr a b -> [Tree Node] dff' :: Graph gr => gr a b -> [Tree Node] dfsWith :: Graph gr => CFun a b c -> [Node] -> gr a b -> [c] udfs :: Graph gr => [Node] -> gr a b -> [Node] udfs' :: Graph gr => gr a b -> [Node] udff :: Graph gr => [Node] -> gr a b -> [Tree Node] udff' :: Graph gr => gr a b -> [Tree Node] rdff :: Graph gr => [Node] -> gr a b -> [Tree Node] rdff' :: Graph gr => gr a b -> [Tree Node] rdfs :: Graph gr => [Node] -> gr a b -> [Node] rdfs' :: Graph gr => gr a b -> [Node] topsort :: Graph gr => gr a b -> [Node] scc :: Graph gr => gr a b -> [[Node]] reachable :: Graph gr => Node -> gr a b -> [Node] components :: Graph gr => gr a b -> [[Node]] noComponents :: Graph gr => gr a b -> Int isConnected :: Graph gr => gr a b -> Bool

Documentation

type CFun a b c = Context a b -> c

dfs :: Graph gr => [Node] -> gr a b -> [Node]

dfs' :: Graph gr => gr a b -> [Node]

dff :: Graph gr => [Node] -> gr a b -> [Tree Node]

dff' :: Graph gr => gr a b -> [Tree Node]

dfsWith :: Graph gr => CFun a b c -> [Node] -> gr a b -> [c]

Undirected DFS

udfs :: Graph gr => [Node] -> gr a b -> [Node]

udfs' :: Graph gr => gr a b -> [Node]

udff :: Graph gr => [Node] -> gr a b -> [Tree Node]

udff' :: Graph gr => gr a b -> [Tree Node]

Reverse DFS

rdff :: Graph gr => [Node] -> gr a b -> [Tree Node]

rdff' :: Graph gr => gr a b -> [Tree Node]

rdfs :: Graph gr => [Node] -> gr a b -> [Node]

rdfs' :: Graph gr => gr a b -> [Node]

Applications of DFS/DFF

topsort :: Graph gr => gr a b -> [Node]

scc :: Graph gr => gr a b -> [[Node]]

reachable :: Graph gr => Node -> gr a b -> [Node]

Applications of UDFS/UDFF

components :: Graph gr => gr a b -> [[Node]]

noComponents :: Graph gr => gr a b -> Int

isConnected :: Graph gr => gr a b -> Bool

Produced by Haddock version 0.6