Modulefgl-5.8.3.1Haskell98

Data.Graph.Inductive.Query.BFS

Breadth-First Search Algorithms

Contents

Synopsis

BFS Node List

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

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

valuebfsWith :: Graph gr => (Context a b -> c) -> Node -> gr a b -> [c]

valuebfsnWith :: Graph gr => (Context a b -> c) -> [Node] -> gr a b -> [c]

valuelevel :: Graph gr => Node -> gr a b -> [(Node, Int)]

valueleveln :: Graph gr => [(Node, Int)] -> gr a b -> [(Node, Int)]

valuebfe :: Graph gr => Node -> gr a b -> [Edge]

valuebfen :: Graph gr => [Edge] -> gr a b -> [Edge]

valuebft :: Graph gr => Node -> gr a b -> RTree

valuelbft :: Graph gr => Node -> gr a b -> LRTree b

typetype RTree = [Path]

valueesp :: Graph gr => Node -> Node -> gr a b -> Path

valuelesp :: Graph gr => Node -> Node -> gr a b -> LPath b