fgl-5.4.2.4: Martin Erwig's Functional Graph Library

Safe HaskellNone

Data.Graph.Inductive.Query.BFS

Contents

Description

Breadth-First Search Algorithms

Synopsis

BFS Node List

bfs :: Graph gr => Node -> gr a b -> [Node]Source

bfsn :: Graph gr => [Node] -> gr a b -> [Node]Source

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

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

Node List With Depth Info

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

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

BFS Edges

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

bfen :: Graph gr => [Edge] -> gr a b -> [Edge]Source

BFS Tree

bft :: Graph gr => Node -> gr a b -> RTreeSource

lbft :: Graph gr => Node -> gr a b -> LRTree bSource

Shortest Path (Number of Edges)

esp :: Graph gr => Node -> Node -> gr a b -> PathSource

lesp :: Graph gr => Node -> Node -> gr a b -> LPath bSource