Minsep.I
Implementation for an imperative graph. Less efficient that the implementation for a persistent graph
module G : sig ... end
module G = G
Implementation of a graph
module Vertex_Set : Stdlib.Set.S with type elt = G.V.t
Implementation of a set of vertex
module VSetset : Stdlib.Set.S with type elt = Vertex_Set.t
Implementation of a set of Vertex_Set
Vertex_Set
val allminsep : G.t -> Vertex_Set.t list
allminsep g computes the list of all minimal separators of g.
allminsep g
val list_of_allminsep : G.t -> G.V.t list list
Less efficient that allminsep
allminsep
val set_of_allminsep : G.t -> VSetset.t