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