Module Minsep.ISource

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

Parameters

module G : sig ... end

Signature

Sourcemodule G = G

Implementation of a graph

Sourcemodule Vertex_Set : Set.S with type elt = G.V.t

Implementation of a set of vertex

Sourcemodule VSetset : Set.S with type elt = Vertex_Set.t

Implementation of a set of Vertex_Set

Sourceval allminsep : G.t -> Vertex_Set.t list

allminsep g computes the list of all minimal separators of g.

Sourceval list_of_allminsep : G.t -> G.V.t list list

Less efficient that allminsep

Sourceval set_of_allminsep : G.t -> VSetset.t

Less efficient that allminsep