module type G = sig .. end
sig
end
Minimal graph signature for the algorithm. Sub-signature of Traverse.G.
Traverse.G
type t
module V: Sig.COMPARABLE
Sig.COMPARABLE
module E: sig .. end
val fold_pred_e : (E.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
(E.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a