Module `Blocks.BidirectionalUnlabeled`Source

Parameters

module V : Sig.COMPARABLE

module HM : HM with type key = V.t

Sourcemodule S : sig ... end

Sourcemodule E : sig ... end

Sourcetype edge = E.t

Sourceval mem_edge : ('a * S.t) HM.t -> HM.key -> S.elt -> bool

Sourceval mem_edge_e : ('a * S.t) HM.t -> (HM.key * S.elt) -> bool

Sourceval find_edge : ('a * S.t) HM.t -> HM.key -> S.elt -> HM.key * S.elt

val find_all_edges : 
  ('a * S.t) HM.t ->
  HM.key ->
  S.elt ->
  (HM.key * S.elt) list

val unsafe_remove_edge : 
  (S.t * S.t) HM.t ->
  HM.key ->
  S.elt ->
  (S.t * S.t) HM.t

val unsafe_remove_edge_e : 
  (S.t * S.t) HM.t ->
  (HM.key * S.elt) ->
  (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 * HM.key) -> (S.t * S.t) HM.t

Sourceval iter_succ : (S.elt -> unit) -> ('a * S.t) HM.t -> HM.key -> unit

Sourceval fold_succ : (S.elt -> 'a -> 'a) -> ('b * S.t) HM.t -> HM.key -> 'a -> 'a

val iter_succ_e : 
  ((HM.key * S.elt) -> unit) ->
  ('a * S.t) HM.t ->
  HM.key ->
  unit

val fold_succ_e : 
  ((HM.key * S.elt) -> 'a -> 'a) ->
  ('b * S.t) HM.t ->
  HM.key ->
  'a ->
  'a

Sourceval succ : ('a * S.t) HM.t -> HM.key -> S.elt list

Sourceval succ_e : ('a * S.t) HM.t -> HM.key -> (HM.key * S.elt) list

Sourceval map_vertex : (V.t -> HM.key) -> (S.t * S.t) HM.t -> (S.t * S.t) HM.t

Sourcemodule I : sig ... end

include module type of struct include I end

Sourcetype t = (S.t * S.t) HM.t

module PV = I.PV

Sourcemodule PE = I.PE

Sourceval iter_edges : (HM.key -> S.elt -> unit) -> ('a * S.t) HM.t -> unit

Sourceval fold_edges : (HM.key -> S.elt -> 'a -> 'a) -> ('b * S.t) HM.t -> 'a -> 'a

Sourceval iter_edges_e : ((HM.key * S.elt) -> unit) -> ('a * S.t) HM.t -> unit

val fold_edges_e : 
  ((HM.key * S.elt) -> 'a -> 'a) ->
  ('b * S.t) HM.t ->
  'a ->
  'a

Sourceval iter_pred : (S.elt -> unit) -> (S.t * 'a) HM.t -> HM.key -> unit

Sourceval fold_pred : (S.elt -> 'a -> 'a) -> (S.t * 'b) HM.t -> HM.key -> 'a -> 'a

Sourceval pred : (S.t * 'a) HM.t -> HM.key -> S.elt list

Sourceval in_degree : (S.t * 'a) HM.t -> HM.key -> int

val iter_pred_e : 
  ((S.elt * HM.key) -> unit) ->
  (S.t * 'a) HM.t ->
  HM.key ->
  unit

val fold_pred_e : 
  ((S.elt * HM.key) -> 'a -> 'a) ->
  (S.t * 'b) HM.t ->
  HM.key ->
  'a ->
  'a

Sourceval pred_e : (S.t * 'a) HM.t -> HM.key -> (S.elt * HM.key) list