Module SL_graph0.G

module Self : sig ... end
include module type of struct include Self end
type t = Graph__Persistent.Digraph.ConcreteBidirectionalLabeled(Astral_internal.SL.Term)(SL_edge).t
module V = Self.V
type vertex = V.t
module E = Self.E
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 -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val find_all_edges : t -> vertex -> vertex -> edge list
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val empty : t
val add_vertex : t -> vertex -> t
val remove_vertex : t -> vertex -> t
val add_edge : t -> vertex -> vertex -> t
val remove_edge : t -> vertex -> vertex -> t
val remove_edge_e : t -> edge -> t
include sig ... end
type g = Self.t
val transitive_closure : ?reflexive:bool -> g -> g
val add_transitive_closure : ?reflexive:bool -> g -> g
val transitive_reduction : ?reflexive:bool -> g -> g
val replace_by_transitive_reduction : ?reflexive:bool -> g -> g
val mirror : g -> g
val complement : g -> g
val intersect : g -> g -> g
val union : g -> g -> g
val add_edge_e : t -> (SL.Term.t * SL_edge.t * SL.Term.t) -> t
include sig ... end
val fprint_graph : Stdlib.Format.formatter -> Graph__Persistent.Digraph.ConcreteBidirectionalLabeled(Astral_internal.SL.Term)(SL_edge).t -> unit
val output_graph : Stdlib.out_channel -> Graph__Persistent.Digraph.ConcreteBidirectionalLabeled(Astral_internal.SL.Term)(SL_edge).t -> unit
val output_file : string -> Graph__Persistent.Digraph.ConcreteBidirectionalLabeled(Astral_internal.SL.Term)(SL_edge).t -> unit