
Data.Graph.Inductive.Query.BFS 




Description 
BreadthFirst Search Algorithms


Synopsis 




BFS Node List


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

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

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

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

Node List With Depth Info


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

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

BFS Edges


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

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

BFS Tree


bft :: Graph gr => Node > gr a b > RTree 

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

Shortest Path (Number of Edges)


esp :: Graph gr => Node > Node > gr a b > Path 

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

Produced by Haddock version 0.7 