Module Path

module Path: sig .. end

Paths

module type G = sig .. end

Minimal graph signature for Dijkstra's algorithm

module type WEIGHT = sig .. end

Signature for edges' weights

module Dijkstra: functor (G : G) -> functor (W : WEIGHT  with type label = G.E.label) -> sig .. end

Check for a path

module Check: functor (G : sigtype t 

module V: Sig.COMPARABLE 
val iter_succ : (V.t -> unit) -> t -> V.t -> unit
end) -> sig .. end