package ocamlgraph

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

Module Digraph.ConcreteBidirectionalLabeledSource

Parameters

module V : Sig.COMPARABLE

Signature

include sig ... end
Sourcemodule V : sig ... end
Sourcemodule HM : sig ... end
include sig ... end
Sourcemodule VE : sig ... end
Sourcemodule S : sig ... end
Sourcemodule E : sig ... end
Sourcetype edge = E.t
Sourceval mem_edge : ('a * S.t) HM.t -> HM.key -> V.t -> bool
Sourceval mem_edge_e : ('a * S.t) HM.t -> (HM.key * Edge.t * V.t) -> bool
Sourceexception Found of edge
Sourceval find_edge : ('a * S.t) HM.t -> E.vertex -> V.t -> edge
Sourceval find_all_edges : ('a * S.t) HM.t -> HM.key -> V.t -> (HM.key * Edge.t * V.t) list
Sourceval unsafe_remove_edge : (S.t * S.t) HM.t -> HM.key -> HM.key -> (S.t * S.t) HM.t
Sourceval unsafe_remove_edge_e : (S.t * S.t) HM.t -> (HM.key * Edge.t * HM.key) -> (S.t * S.t) HM.t
Sourceval remove_edge : (S.t * S.t) HM.t -> HM.key -> HM.key -> (S.t * S.t) HM.t
Sourceval remove_edge_e : (S.t * S.t) HM.t -> (HM.key * Edge.t * HM.key) -> (S.t * S.t) HM.t
Sourceval iter_succ : (V.t -> unit) -> ('a * S.t) HM.t -> HM.key -> unit
Sourceval fold_succ : (V.t -> 'a -> 'a) -> ('b * S.t) HM.t -> HM.key -> 'a -> 'a
Sourceval iter_succ_e : ((HM.key * Edge.t * V.t) -> unit) -> ('a * S.t) HM.t -> HM.key -> unit
Sourceval fold_succ_e : ((HM.key * Edge.t * V.t) -> 'a -> 'a) -> ('b * S.t) HM.t -> HM.key -> 'a -> 'a
Sourceval succ : ('a * S.t) HM.t -> HM.key -> V.t list
Sourceval succ_e : ('a * S.t) HM.t -> HM.key -> (HM.key * Edge.t * V.t) list
Sourceval map_vertex : (HM.key -> HM.key) -> (S.t * S.t) HM.t -> (S.t * S.t) HM.t
Sourcemodule I : sig ... end
Sourcetype t = (S.t * S.t) HM.t
Sourcemodule PV = I.PV
Sourcemodule PE = E
Sourceval iter_edges : (HM.key -> V.t -> unit) -> ('a * S.t) HM.t -> unit
Sourceval fold_edges : (HM.key -> V.t -> 'a -> 'a) -> ('b * S.t) HM.t -> 'a -> 'a
Sourceval iter_edges_e : ((HM.key * Edge.t * V.t) -> unit) -> ('a * S.t) HM.t -> unit
Sourceval fold_edges_e : ((HM.key * Edge.t * V.t) -> 'a -> 'a) -> ('b * S.t) HM.t -> 'a -> 'a
Sourceval iter_pred : (V.t -> unit) -> (S.t * 'a) HM.t -> HM.key -> unit
Sourceval fold_pred : (V.t -> 'a -> 'a) -> (S.t * 'b) HM.t -> HM.key -> 'a -> 'a
Sourceval in_degree : (S.t * 'a) HM.t -> HM.key -> int
Sourceval iter_pred_e : ((V.t * Edge.t * HM.key) -> unit) -> (S.t * 'a) HM.t -> HM.key -> unit
Sourceval fold_pred_e : ((V.t * Edge.t * HM.key) -> 'a -> 'a) -> (S.t * 'b) HM.t -> HM.key -> 'a -> 'a
Sourceval pred : (S.t * 'a) HM.t -> HM.key -> V.t list
Sourceval pred_e : (S.t * 'a) HM.t -> HM.key -> (V.t * Edge.t * HM.key) list
include sig ... end
Sourcetype vertex = HM.key
Sourceval is_directed : bool
Sourceval empty : 'a HM.return
Sourceval create : ?size:int -> unit -> 'a HM.t
Sourceval clear : 'a HM.t -> unit
Sourceval is_empty : 'a HM.t -> bool
Sourceval copy : 'a HM.t -> 'a HM.t
Sourceval nb_vertex : 'a HM.t -> int
Sourceval nb_edges : ('a * S.t) HM.t -> int
Sourceval out_degree : ('a * S.t) HM.t -> HM.key -> int
Sourceval mem_vertex : 'a HM.t -> HM.key -> bool
Sourceval unsafe_add_vertex : (S.t * S.t) HM.t -> HM.key -> (S.t * S.t) HM.t
Sourceval add_vertex : (S.t * S.t) HM.t -> HM.key -> (S.t * S.t) HM.t
Sourceval iter_vertex : (HM.key -> unit) -> 'a HM.t -> unit
Sourceval fold_vertex : (HM.key -> 'a -> 'a) -> 'b HM.t -> 'a -> 'a
Sourceval unsafe_add_edge_e : (S.t * S.t) HM.t -> (HM.key * Edge.t * V.t) -> (S.t * S.t) HM.t
Sourceval add_edge_e : (S.t * S.t) HM.t -> (HM.key * Edge.t * V.t) -> (S.t * S.t) HM.t
Sourceval add_edge : (S.t * S.t) HM.t -> HM.key -> V.t -> (S.t * S.t) HM.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