module type G = sig ... endMinimal signature for computing the minimal separators
module type MINSEP = sig ... endmodule P : functor (G : sig ... end) -> MINSEP with module G = GImplementation for a persistent graph
module I : functor (G : sig ... end) -> MINSEP with module G = GImplementation for an imperative graph. Less efficient that the implementation for a persistent graph