Module Graph.Path

Paths

module type G = sig ... end

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

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 ... end) -> sig ... end

Check for a path.