Module Traverse.Bfs
Breadth-first search
Parameters
Signature
Classical big-step iterators
val iter : ( G.V.t -> unit ) -> G.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