`sig
type t
module V : VERTEX
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
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = Sig.G.E.t
val is_directed : bool
val is_empty : Sig.G.t -> bool
val nb_vertex : Sig.G.t -> int
val nb_edges : Sig.G.t -> int
val out_degree : Sig.G.t -> Sig.G.vertex -> int
val in_degree : Sig.G.t -> Sig.G.vertex -> int
val mem_vertex : Sig.G.t -> Sig.G.vertex -> bool
val mem_edge : Sig.G.t -> Sig.G.vertex -> Sig.G.vertex -> bool
val mem_edge_e : Sig.G.t -> Sig.G.edge -> bool
val find_edge : Sig.G.t -> Sig.G.vertex -> Sig.G.vertex -> Sig.G.edge
val find_all_edges :
Sig.G.t -> Sig.G.vertex -> Sig.G.vertex -> Sig.G.edge list
val succ : Sig.G.t -> Sig.G.vertex -> Sig.G.vertex list
val pred : Sig.G.t -> Sig.G.vertex -> Sig.G.vertex list
val succ_e : Sig.G.t -> Sig.G.vertex -> Sig.G.edge list
val pred_e : Sig.G.t -> Sig.G.vertex -> Sig.G.edge list
val iter_vertex : (Sig.G.vertex -> unit) -> Sig.G.t -> unit
val fold_vertex : (Sig.G.vertex -> 'a -> 'a) -> Sig.G.t -> 'a -> 'a
val iter_edges : (Sig.G.vertex -> Sig.G.vertex -> unit) -> Sig.G.t -> unit
val fold_edges :
(Sig.G.vertex -> Sig.G.vertex -> 'a -> 'a) -> Sig.G.t -> 'a -> 'a
val iter_edges_e : (Sig.G.edge -> unit) -> Sig.G.t -> unit
val fold_edges_e : (Sig.G.edge -> 'a -> 'a) -> Sig.G.t -> 'a -> 'a
val map_vertex : (Sig.G.vertex -> Sig.G.vertex) -> Sig.G.t -> Sig.G.t
val iter_succ : (Sig.G.vertex -> unit) -> Sig.G.t -> Sig.G.vertex -> unit
val iter_pred : (Sig.G.vertex -> unit) -> Sig.G.t -> Sig.G.vertex -> unit
val fold_succ :
(Sig.G.vertex -> 'a -> 'a) -> Sig.G.t -> Sig.G.vertex -> 'a -> 'a
val fold_pred :
(Sig.G.vertex -> 'a -> 'a) -> Sig.G.t -> Sig.G.vertex -> 'a -> 'a
val iter_succ_e : (Sig.G.edge -> unit) -> Sig.G.t -> Sig.G.vertex -> unit
val fold_succ_e :
(Sig.G.edge -> 'a -> 'a) -> Sig.G.t -> Sig.G.vertex -> 'a -> 'a
val iter_pred_e : (Sig.G.edge -> unit) -> Sig.G.t -> Sig.G.vertex -> unit
val fold_pred_e :
(Sig.G.edge -> 'a -> 'a) -> Sig.G.t -> Sig.G.vertex -> 'a -> 'a
end`