## Parameters

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

## Signature

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