module type G =Minimal graph signature for work list algorithmsig..end
type t
module V:Sig.COMPARABLE
module E:sig..end
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'aval succ_e : t -> V.t -> E.t listval pred_e : t -> V.t -> E.t listval succ : t -> V.t -> V.t listval pred : t -> V.t -> V.t list