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