Module Graph.Path
Paths
module type G = sig ... end
Minimal graph signature for Dijkstra's algorithm. Sub-signature of
Sig.G
.
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.