Module type Path.G

module type G = sig .. end

Minimal graph signature for Dijkstra's algorithm. Sub-signature of Sig.G.

type t

module V: Sig.COMPARABLE

module E: sig .. end

val iter_vertex : (V.t -> unit) -> t -> unit

val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a

val iter_succ : (V.t -> unit) -> t -> V.t -> unit

val iter_succ_e : (E.t -> unit) -> t -> V.t -> unit

val fold_edges_e : (E.t -> 'a -> 'a) -> t -> 'a -> 'a

val nb_vertex : t -> int