Graph.PathPaths
module type G = sig ... endMinimal graph signature for Dijkstra's algorithm. Sub-signature of Sig.G.
module BellmanFord
(G : G)
(W : Sig.WEIGHT with type edge = G.E.t) :
sig ... endmodule type WJ = sig ... endWeight signature for Johnson's algorithm.