Module Traverse.Bfs

Breadth-first search

Parameters

module G : G

Signature

Classical big-step iterators

val iter : ( G.V.t -> unit ) -> G.t -> unit
val iter_component : ( G.V.t -> unit ) -> G.t -> G.V.t -> unit

Classical folds

val fold : ( G.V.t -> 'a -> 'a ) -> 'a -> G.t -> 'a
val fold_component : ( G.V.t -> 'a -> 'a ) -> 'a -> G.t -> G.V.t -> 'a

Step-by-step iterator

See module Dfs

type iterator
val start : G.t -> iterator
val step : iterator -> iterator
val get : iterator -> G.V.t