Dfs (ocamlgraph.Graph.Pack.Digraph.Dfs)

val iter : ?pre:(V.t -> unit) -> ?post:(V.t -> unit) -> t -> unit

val prefix : (V.t -> unit) -> t -> unit

val postfix : (V.t -> unit) -> t -> unit

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

val iter_component : 
  ?pre:(V.t -> unit) ->
  ?post:(V.t -> unit) ->
  t ->
  V.t ->
  unit

val prefix_component : (V.t -> unit) -> t -> V.t -> unit

val postfix_component : (V.t -> unit) -> t -> V.t -> unit

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

val has_cycle : t -> bool