package ocamlgraph

  1. Overview
  2. Docs

Module Blocks.LabeledSource

Common implementation to all the labeled (directed) graphs.

Parameters

module V : Sig.COMPARABLE
module HM : HM with type key = V.t

Signature

Sourcemodule VE : sig ... end
Sourcemodule S : sig ... end
Sourcemodule E : sig ... end
Sourcetype edge = E.t
Sourceval mem_edge : S.t HM.t -> HM.key -> V.t -> bool
Sourceval mem_edge_e : S.t HM.t -> (HM.key * E.t * V.t) -> bool
Sourceexception Found of edge
Sourceval find_edge : S.t HM.t -> E.vertex -> V.t -> edge
Sourceval find_all_edges : S.t HM.t -> HM.key -> V.t -> (HM.key * E.t * V.t) list
Sourceval unsafe_remove_edge : S.t HM.t -> HM.key -> V.t -> S.t HM.t
Sourceval unsafe_remove_edge_e : S.t HM.t -> (HM.key * E.t * V.t) -> S.t HM.t
Sourceval remove_edge : S.t HM.t -> HM.key -> HM.key -> S.t HM.t
Sourceval remove_edge_e : S.t HM.t -> (HM.key * E.t * HM.key) -> S.t HM.t
Sourceval iter_succ : (V.t -> unit) -> S.t HM.t -> HM.key -> unit
Sourceval fold_succ : (V.t -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'a
Sourceval iter_succ_e : ((HM.key * E.t * V.t) -> unit) -> S.t HM.t -> HM.key -> unit
Sourceval fold_succ_e : ((HM.key * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'a
Sourceval succ : S.t HM.t -> HM.key -> V.t list
Sourceval succ_e : S.t HM.t -> HM.key -> (HM.key * E.t * V.t) list
Sourceval map_vertex : (V.t -> HM.key) -> S.t HM.t -> S.t HM.t
Sourcemodule I : sig ... end
include module type of struct include I end
Sourcetype t = S.t HM.t
Sourcemodule PV = I.PV
Sourcemodule PE = I.PE
Sourceval iter_edges : (HM.key -> V.t -> unit) -> S.t HM.t -> unit
Sourceval fold_edges : (HM.key -> V.t -> 'a -> 'a) -> S.t HM.t -> 'a -> 'a
Sourceval iter_edges_e : ((HM.key * E.t * V.t) -> unit) -> S.t HM.t -> unit
Sourceval fold_edges_e : ((HM.key * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> 'a -> 'a
include sig ... end
Sourceval iter_pred : (V.t -> unit) -> S.t HM.t -> V.t -> unit
Sourceval fold_pred : (V.t -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'a
Sourceval pred : S.t HM.t -> V.t -> V.t list
Sourceval in_degree : S.t HM.t -> V.t -> int
Sourceval iter_pred_e : ((V.t * E.t * V.t) -> unit) -> S.t HM.t -> V.t -> unit
Sourceval fold_pred_e : ((V.t * E.t * V.t) -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'a
Sourceval pred_e : S.t HM.t -> V.t -> (V.t * E.t * V.t) list