Module Path

module Path: sig .. end

Paths

module type G = sig .. end

Minimal graph signature for Dijkstra's algorithm.

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

module BellmanFord: functor (G : G) -> functor (W : Sig.WEIGHT  with type edge = G.E.t) -> sig .. end

module type WJ = sig .. end

Weight signature for Johnson's algorithm.

module Johnson: functor (G : G) -> functor (W : WJ  with type edge = G.E.t) -> sig .. end

module Check: functor (G : sig
type t 


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

Check for a path.