sig
module type S =
sig
type g
val transitive_closure : ?reflexive:bool -> Oper.S.g -> Oper.S.g
val add_transitive_closure : ?reflexive:bool -> Oper.S.g -> Oper.S.g
val mirror : Oper.S.g -> Oper.S.g
val complement : Oper.S.g -> Oper.S.g
val intersect : Oper.S.g -> Oper.S.g -> Oper.S.g
val union : Oper.S.g -> Oper.S.g -> Oper.S.g
end
module Make :
functor (G : Sig.G) ->
functor
(B : sig
module G :
sig
type t = G.t
module V :
sig
type t = G.V.t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label = G.V.label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t = G.E.t
val compare : t -> t -> int
val src : t -> V.t
val dst : t -> V.t
type label = G.E.label
val create : V.t -> label -> V.t -> 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 -> V.t -> int
val in_degree : t -> V.t -> int
val mem_vertex : t -> V.t -> bool
val mem_edge : t -> V.t -> V.t -> bool
val mem_edge_e : t -> E.t -> bool
val succ : t -> V.t -> V.t list
val pred : t -> V.t -> V.t list
val succ_e : t -> V.t -> E.t list
val pred_e : t -> V.t -> E.t list
val iter_vertex : (V.t -> unit) -> t -> unit
val iter_edges : (V.t -> V.t -> unit) -> t -> unit
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_edges : (V.t -> V.t -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (V.t -> V.t) -> t -> t
val iter_edges_e : (E.t -> unit) -> t -> unit
val fold_edges_e : (E.t -> 'a -> 'a) -> t -> 'a -> 'a
val iter_succ : (V.t -> unit) -> t -> V.t -> unit
val iter_pred : (V.t -> unit) -> t -> V.t -> unit
val fold_succ : (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
val fold_pred : (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
val iter_succ_e : (E.t -> unit) -> t -> V.t -> unit
val fold_succ_e :
(E.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
val iter_pred_e : (E.t -> unit) -> t -> V.t -> unit
val fold_pred_e :
(E.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
end
val empty : unit -> G.t
val copy : G.t -> G.t
val add_vertex : G.t -> G.V.t -> G.t
val add_edge : G.t -> G.V.t -> G.V.t -> G.t
val add_edge_e : G.t -> G.E.t -> G.t
end) ->
sig
type g = G.t
val transitive_closure : ?reflexive:bool -> g -> g
val add_transitive_closure : ?reflexive:bool -> g -> g
val mirror : g -> g
val complement : g -> g
val intersect : g -> g -> g
val union : g -> g -> g
end
module P :
functor (G : Sig.P) ->
sig
type g = G.t
val transitive_closure : ?reflexive:bool -> g -> g
val add_transitive_closure : ?reflexive:bool -> g -> g
val mirror : g -> g
val complement : g -> g
val intersect : g -> g -> g
val union : g -> g -> g
end
module I :
functor (G : Sig.I) ->
sig
type g = G.t
val transitive_closure : ?reflexive:bool -> g -> g
val add_transitive_closure : ?reflexive:bool -> g -> g
val mirror : g -> g
val complement : g -> g
val intersect : g -> g -> g
val union : g -> g -> g
end
module Choose :
functor
(G : sig
type t
type vertex
type edge
val iter_vertex :
(Oper.Choose.vertex -> unit) -> Oper.Choose.t -> unit
val iter_edges_e :
(Oper.Choose.edge -> unit) -> Oper.Choose.t -> unit
end) ->
sig
val choose_vertex : G.t -> G.vertex
val choose_edge : G.t -> G.edge
end
module Difference :
sig
module P :
functor (G : Sig.P) ->
sig
module VertexSet :
sig
type elt = G.V.t
type t = Set.Make(G.V).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
val minus_vertex : G.t -> G.V.t -> G.t
val minus_vertices : G.t -> Oper.Difference.P.VertexSet.t -> G.t
end
module I :
functor (G : Sig.I) ->
sig
module VertexSet :
sig
type elt = G.V.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
val minus_vertex : G.t -> G.V.t -> unit
val minus_vertices : G.t -> Oper.Difference.I.VertexSet.t -> unit
end
end
end