Module type Leaderlist.G

module type G = sig .. end
Minimal graph signature for leader list algorithm

type t 
module V: Sig.COMPARABLE 
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
val succ : t -> V.t -> V.t list
val pred : t -> V.t -> V.t list