functor
(G : sig
type t
module V : Sig.COMPARABLE
val fold_succ :
(V.t -> 'a -> 'a) -> Oper.Neighbourhood.t -> V.t -> 'a -> 'a
val succ : Oper.Neighbourhood.t -> V.t -> V.t list
end) ->
sig
module Vertex_Set :
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 list_from_vertex : G.t -> G.V.t -> G.V.t list
val set_from_vertex : G.t -> G.V.t -> Oper.Neighbourhood.Vertex_Set.t
val list_from_vertices : G.t -> G.V.t list -> G.V.t list
val set_from_vertices :
G.t -> G.V.t list -> Oper.Neighbourhood.Vertex_Set.t
end