`functor (G : Sig.G) ->
sig
module CliqueV :
sig
type t
val compare :
Cliquetree.CliqueTree.CliqueV.t ->
Cliquetree.CliqueTree.CliqueV.t -> int
val hash : Cliquetree.CliqueTree.CliqueV.t -> int
val equal :
Cliquetree.CliqueTree.CliqueV.t ->
Cliquetree.CliqueTree.CliqueV.t -> bool
val label :
Cliquetree.CliqueTree.CliqueV.t -> Cliquetree.CliqueTree.CliqueV.t
val create : G.V.t -> Cliquetree.CliqueTree.CliqueV.t
val vertex : Cliquetree.CliqueTree.CliqueV.t -> G.V.t
end
module CVS :
sig
type elt = CliqueV.t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
end
module CliqueTreeV :
sig
type data =
Cliquetree.CliqueTree.CliqueV.t list *
Cliquetree.CliqueTree.CVS.t
type label
type t
val compare :
Cliquetree.CliqueTree.CliqueTreeV.t ->
Cliquetree.CliqueTree.CliqueTreeV.t -> int
val hash : Cliquetree.CliqueTree.CliqueTreeV.t -> int
val equal :
Cliquetree.CliqueTree.CliqueTreeV.t ->
Cliquetree.CliqueTree.CliqueTreeV.t -> bool
val create :
Cliquetree.CliqueTree.CliqueTreeV.data ->
Cliquetree.CliqueTree.CliqueTreeV.label ->
Cliquetree.CliqueTree.CliqueTreeV.t
val label :
Cliquetree.CliqueTree.CliqueTreeV.t ->
Cliquetree.CliqueTree.CliqueTreeV.label
val data :
Cliquetree.CliqueTree.CliqueTreeV.t ->
Cliquetree.CliqueTree.CliqueTreeV.data
end
module CliqueTreeE :
sig
type t = int * Cliquetree.CliqueTree.CVS.t
val compare :
Cliquetree.CliqueTree.CliqueTreeE.t ->
Cliquetree.CliqueTree.CliqueTreeE.t -> int
val default : Cliquetree.CliqueTree.CliqueTreeE.t
val create :
int ->
Cliquetree.CliqueTree.CVS.t -> Cliquetree.CliqueTree.CliqueTreeE.t
val vertices :
Cliquetree.CliqueTree.CliqueTreeE.t -> Cliquetree.CliqueTree.CVS.t
end
module CliqueTree :
sig
type t
module V :
sig
type t = CliqueTreeV.t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label = CliqueTreeE.t
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val find_all_edges : t -> vertex -> vertex -> edge list
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
end
val mcs_clique :
G.t ->
G.V.t list * Cliquetree.CliqueTree.CliqueTree.t *
Cliquetree.CliqueTree.CliqueTree.V.t
val is_chordal : G.t -> bool
val maxwidth : G.t -> G.t -> Cliquetree.CliqueTree.CliqueTree.t -> int
end`