Functor Traversal.Bfs

module Bfs (A : A)  (G : G) : sig .. end
Parameters:
A : A
G : G

module T: Traversal.Traversal(A)
include T
module Queue: Vector.Queue(sig
type t = int 
end)
exception Found of T.t
val forest : ?find:Queue.V.elt option ->
?follow_succ:bool ->
?follow_pred:bool ->
Traversal.G.t -> Queue.V.elt list -> T.t
val tree : ?follow_succ:bool ->
?follow_pred:bool ->
Traversal.G.t -> Queue.V.elt -> T.t
val find_dist : ?follow_succ:bool ->
?follow_pred:bool ->
Traversal.G.t ->
Queue.V.elt -> Queue.V.elt -> int
Raises Not_found if v is not reachable from u.