Module Digraph.DfsSource

Depth-first search

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

iter 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.

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

applies only a prefix function

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

applies only a postfix function

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

Same thing, but for a single connected component

Sourceval iter_component : ?pre:(V.t -> unit) -> ?post:(V.t -> unit) -> t -> V.t -> unit
Sourceval prefix_component : (V.t -> unit) -> t -> V.t -> unit
Sourceval postfix_component : (V.t -> unit) -> t -> V.t -> unit
Sourceval fold_component : (V.t -> 'a -> 'a) -> 'a -> t -> V.t -> 'a
Sourceval has_cycle : t -> bool