Module `Graph__Minsep.I`

Implementation for an imperative graph. Less efficient that the implementation for a persistent graph

Parameters

G : sig ... end

Signature

module G = G: Implementation of a graph

module Vertex_Set : Stdlib.Set.S with type Vertex_Set.elt = G.V.t: Implementation of a set of vertex

module VSetset : Stdlib.Set.S with type VSetset.elt = Vertex_Set.t: Implementation of a set of Vertex_Set

val allminsep : G.t -> Vertex_Set.t list: allminsep g computes the list of all minimal separators of g.

val list_of_allminsep : G.t -> G.V.t list list: Less efficient that allminsep

val set_of_allminsep : G.t -> VSetset.t: Less efficient that allminsep