sig
module G :
sig
module V :
sig
type t = State.t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label = State.t
val create : label -> t
val label : t -> label
end
module E :
sig
type t = State.t * State.t
val compare : t -> t -> int
type vertex = State.t
val src : t -> vertex
val dst : t -> vertex
type label
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type t
val iter_vertex : (V.t -> unit) -> t -> unit
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (E.t -> unit) -> t -> unit
val fold_edges : (V.t -> V.t -> 'a -> 'a) -> t -> 'a -> 'a
val fold_edges_e : (E.t -> 'a -> 'a) -> t -> 'a -> 'a
val iter_succ : (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 mem_vertex : t -> V.t -> bool
val mem_edge_e : t -> E.t -> bool
val in_degree : t -> V.t -> int
val out_degree : t -> V.t -> int
val nb_vertex : t -> int
end
val graph : G.t
val add_dependencies : from:State.t -> State.t list -> unit
val add_codependencies : onto:State.t -> State.t list -> unit
type t
val create : unit -> t
val clear : t -> unit
val get : unit -> t
val set : t -> unit
val clear_some_projects : (Project_skeleton.t -> bool) -> t -> bool
val add_state : State.t -> State.t list -> unit
end