module type G =Minimal graph signature forsig
..end
Traverse.Dfs
and Traverse.Bfs
.
Sub-signature of Sig.G
.type
t
module V:Sig.COMPARABLE
val iter_vertex : (V.t -> unit) -> t -> unit
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
val iter_succ : (V.t -> unit) -> t -> V.t -> unit
val fold_succ : (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a