module Bfs:
Breadth-first search
Parameters: |
|
val iter : (G.V.t -> unit) -> Traverse.G.t -> unit
val iter_component : (G.V.t -> unit) -> Traverse.G.t -> G.V.t -> unit
val fold : (G.V.t -> 'a -> 'a) -> 'a -> Traverse.G.t -> 'a
val fold_component : (G.V.t -> 'a -> 'a) -> 'a -> Traverse.G.t -> G.V.t -> 'a
See module Dfs
type
iterator
val start : Traverse.G.t -> iterator
val step : iterator -> iterator
val get : iterator -> G.V.t