package ocamlgraph

  1. Overview
  2. Docs
package ocamlgraph
Legend:
Library
Module
Module type
Parameter
Class
Class type
module V = V
module HM : sig ... end
include sig ... end
module VE : sig ... end
module S : sig ... end
module E : sig ... end
type edge = E.t
val mem_edge : S.t HM.t -> HM.key -> V.t -> bool
val mem_edge_e : S.t HM.t -> (HM.key * E.t * V.t) -> bool
exception Found of edge
val find_edge : S.t HM.t -> E.vertex -> V.t -> edge
val find_all_edges : S.t HM.t -> HM.key -> V.t -> (HM.key * E.t * V.t) list
val unsafe_remove_edge : S.t HM.t -> HM.key -> V.t -> S.t HM.t
val unsafe_remove_edge_e : S.t HM.t -> (HM.key * E.t * V.t) -> S.t HM.t
val remove_edge : S.t HM.t -> HM.key -> HM.key -> S.t HM.t
val remove_edge_e : S.t HM.t -> (HM.key * E.t * HM.key) -> S.t HM.t
val iter_succ : (V.t -> unit) -> S.t HM.t -> HM.key -> unit
val fold_succ : (V.t -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'a
val iter_succ_e : ((HM.key * E.t * V.t) -> unit) -> S.t HM.t -> HM.key -> unit
val fold_succ_e : ((HM.key * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'a
val succ : S.t HM.t -> HM.key -> V.t list
val succ_e : S.t HM.t -> HM.key -> (HM.key * E.t * V.t) list
val map_vertex : (HM.key -> HM.key) -> S.t HM.t -> S.t HM.t
module I : sig ... end
type t = S.t HM.t
module PV = I.PV
module PE = E
val iter_edges : (HM.key -> V.t -> unit) -> S.t HM.t -> unit
val fold_edges : (HM.key -> V.t -> 'a -> 'a) -> S.t HM.t -> 'a -> 'a
val iter_edges_e : ((HM.key * E.t * V.t) -> unit) -> S.t HM.t -> unit
val fold_edges_e : ((HM.key * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> 'a -> 'a
val iter_pred : (V.t -> unit) -> S.t HM.t -> V.t -> unit
val fold_pred : (V.t -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'a
val pred : S.t HM.t -> V.t -> V.t list
val in_degree : S.t HM.t -> V.t -> int
val iter_pred_e : ((V.t * E.t * V.t) -> unit) -> S.t HM.t -> V.t -> unit
val fold_pred_e : ((V.t * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'a
val pred_e : S.t HM.t -> V.t -> (V.t * E.t * V.t) list
include sig ... end
type vertex = HM.key
val is_directed : bool
val empty : 'a HM.return
val create : ?size:int -> unit -> 'a HM.t
val is_empty : 'a HM.t -> bool
val copy : 'a HM.t -> 'a HM.t
val clear : 'a HM.t -> unit
val nb_vertex : 'a HM.t -> int
val nb_edges : S.t HM.t -> int
val out_degree : S.t HM.t -> HM.key -> int
val mem_vertex : 'a HM.t -> HM.key -> bool
val unsafe_add_vertex : S.t HM.t -> HM.key -> S.t HM.t
val unsafe_add_edge : S.t HM.t -> HM.key -> S.elt -> S.t HM.t
val add_vertex : S.t HM.t -> HM.key -> S.t HM.t
val iter_vertex : (HM.key -> unit) -> 'a HM.t -> unit
val fold_vertex : (HM.key -> 'a -> 'a) -> 'b HM.t -> 'a -> 'a
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