val iter : ?pre:(V.t -> unit) -> ?post:(V.t -> unit) -> t -> unititer pre post g visits all nodes of g in depth-first search, applying pre to each visited node before its successors, and post after them. Each node is visited exactly once.
val prefix : (V.t -> unit) -> t -> unitapplies only a prefix function
val postfix : (V.t -> unit) -> t -> unitapplies only a postfix function
val fold : (V.t -> 'a -> 'a) -> 'a -> t -> 'aSame thing, but for a single connected component
val iter_component : ?pre:(V.t -> unit) -> ?post:(V.t -> unit) -> t -> V.t -> unitval prefix_component : (V.t -> unit) -> t -> V.t -> unitval postfix_component : (V.t -> unit) -> t -> V.t -> unitval fold_component : (V.t -> 'a -> 'a) -> 'a -> t -> V.t -> 'aval has_cycle : t -> bool