package ocamlgraph

  1. Overview
  2. Docs
package ocamlgraph
Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module V : Sig.VERTEX

Signature

module G : sig ... end
include sig ... end
module I : sig ... end
type t = I.t = {
  1. edges : G.t;
  2. mutable size : int;
}
type vertex = G.vertex
type edge = G.edge
module PV = I.PV
module PE = I.PE
val iter_edges : (G.vertex -> G.vertex -> unit) -> t -> unit
val fold_edges : (G.vertex -> G.vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (G.edge -> unit) -> t -> unit
val fold_edges_e : (G.edge -> 'a -> 'a) -> t -> 'a -> 'a
val create : ?size:int -> unit -> t
val clear : t -> unit
val iter_pred : (I.PV.t -> unit) -> I.t -> I.PV.t -> unit
val fold_pred : (I.PV.t -> 'a -> 'b) -> I.t -> I.PV.t -> 'c -> 'c
val pred : I.t -> I.PV.t -> I.PV.t list
val iter_pred_e : (I.PE.t -> unit) -> I.t -> I.PV.t -> unit
val fold_pred_e : (I.PE.t -> 'a -> 'b) -> I.t -> I.PV.t -> 'c -> 'c
val pred_e : I.t -> I.PV.t -> I.PE.t list
val is_empty : t -> bool
val nb_vertex : t -> int
module V : sig ... end
module E : sig ... end
module HM : sig ... end
module S : sig ... end
val unsafe_add_edge : G.t -> G.vertex -> G.S.elt -> G.t
val unsafe_remove_edge : G.t -> G.vertex -> G.vertex -> G.t
val unsafe_remove_edge_e : G.t -> G.edge -> G.t
val is_directed : bool
val remove_edge : t -> G.vertex -> G.vertex -> G.t
val remove_edge_e : t -> G.edge -> G.t
val out_degree : t -> G.vertex -> int
val in_degree : t -> G.vertex -> int
val nb_edges : t -> int
val succ : t -> G.vertex -> G.vertex list
val mem_vertex : t -> G.vertex -> bool
val mem_edge : t -> G.vertex -> G.vertex -> bool
val mem_edge_e : t -> G.edge -> bool
val find_edge : t -> G.vertex -> G.vertex -> G.edge
val find_all_edges : t -> G.vertex -> G.vertex -> G.edge list
val iter_vertex : (G.vertex -> unit) -> t -> unit
val fold_vertex : (G.vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_succ : (G.vertex -> unit) -> t -> G.vertex -> unit
val fold_succ : (G.vertex -> 'a -> 'a) -> t -> G.vertex -> 'a -> 'a
val succ_e : t -> G.vertex -> G.edge list
val iter_succ_e : (G.edge -> unit) -> t -> G.vertex -> unit
val fold_succ_e : (G.edge -> 'a -> 'a) -> t -> G.vertex -> 'a -> 'a
val map_vertex : (G.vertex -> G.vertex) -> t -> t
val copy : t -> t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct