package ocamlgraph

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

Module Digraph.AbstractSource

Parameters

module V : Sig.VERTEX

Signature

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