Module Graph.Path

Paths

module type G = sig ... end

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

module Dijkstra (G : G) (W : Sig.WEIGHT with type edge = G.E.t) : sig ... end
module BellmanFord (G : G) (W : Sig.WEIGHT with type edge = G.E.t) : sig ... end
module type WJ = sig ... end

Weight signature for Johnson's algorithm.

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

Check for a path.