Module type Path.G


module type G = sig  end
Minimal graph signature for Dijkstra's algorithm

type t 
module V: Sig.COMPARABLE
module E: sig  end
val iter_succ_e : (E.t -> unit) -> t -> V.t -> unit