Functor IntDigraph.OcamlGraph.Concrete

module Concrete (G : IntDigraph.LS  with type v_label = unit) : sig .. end

include G

module V: sig .. end

module E: sig .. end

val nb_vertex : t -> int

val nb_edges : t -> int

val is_empty : t -> bool

val add_edge_e : 'a -> t * int * e_label -> int -> unit

val mem_edge_e : t -> int * 'a * int -> bool

val find_edge : 'a -> t -> int -> t * (int -> e_label) * int

val find_all_edges : t -> int -> int -> (int * e_label * int) list

val succ : t -> int -> int list

val succ_e : t -> int -> (int * e_label * int) list

val iter_succ_e : (int * e_label * int -> unit) -> t -> int -> unit

val fold_succ_e : ('a * e_label * int -> 'b -> 'b) -> t -> 'a -> int -> 'b -> 'b

val iter_edges_e : (int -> int * e_label * int -> unit) -> t -> unit

val fold_edges_e : (int * e_label * int -> 'a -> 'a) -> t -> 'a -> 'a

val pred : t -> int -> int list

val pred_e : t -> int -> (int * e_label * int) list

val iter_pred_e : (int * e_label * int -> unit) -> t -> int -> unit

val fold_pred_e : ('a * e_label * int -> 'b -> 'b) -> t -> 'a -> int -> 'b -> 'b