fgl-5.4.1.1: Martin Erwig's Functional Graph Library
Source code
Contents
Index
Data.Graph.Inductive.Query.BFS
Contents
BFS Node List
Node List With Depth Info
BFS Edges
BFS Tree
Shortest Path (Number of Edges)
Description
Breadth-First Search Algorithms
Synopsis
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]
level
::
Graph
gr =>
Node
-> gr a b -> [(
Node
,
Int
)]
leveln
::
Graph
gr => [(
Node
,
Int
)] -> gr a b -> [(
Node
,
Int
)]
bfe
::
Graph
gr =>
Node
-> gr a b -> [
Edge
]
bfen
::
Graph
gr => [
Edge
] -> gr a b -> [
Edge
]
bft
::
Graph
gr =>
Node
-> gr a b ->
RTree
lbft
::
Graph
gr =>
Node
-> gr a b ->
LRTree
b
esp
::
Graph
gr =>
Node
->
Node
-> gr a b ->
Path
lesp
::
Graph
gr =>
Node
->
Node
-> gr a b ->
LPath
b
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 ->
RTree
Source
lbft
::
Graph
gr =>
Node
-> gr a b ->
LRTree
b
Source
Shortest Path (Number of Edges)
esp
::
Graph
gr =>
Node
->
Node
-> gr a b ->
Path
Source
lesp
::
Graph
gr =>
Node
->
Node
-> gr a b ->
LPath
b
Source
Produced by
Haddock
version 0.8