Parameters
Signature
type edge = E.t
val mem_edge : S.t HM.t -> HM.key -> S.elt -> boolval mem_edge_e : S.t HM.t -> (HM.key * S.elt) -> boolval find_edge : S.t HM.t -> HM.key -> S.elt -> HM.key * S.eltval find_all_edges : S.t HM.t -> HM.key -> S.elt -> (HM.key * S.elt) listval unsafe_remove_edge : S.t HM.t -> HM.key -> S.elt -> S.t HM.tval unsafe_remove_edge_e : S.t HM.t -> (HM.key * S.elt) -> S.t HM.tval remove_edge : S.t HM.t -> HM.key -> HM.key -> S.t HM.tval remove_edge_e : S.t HM.t -> (HM.key * HM.key) -> S.t HM.tval iter_succ : (S.elt -> unit) -> S.t HM.t -> HM.key -> unitval fold_succ : (S.elt -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'aval iter_succ_e : ((HM.key * S.elt) -> unit) -> S.t HM.t -> HM.key -> unitval fold_succ_e : ((HM.key * S.elt) -> 'a -> 'a) -> S.t HM.t -> HM.key -> 'a -> 'aval succ : S.t HM.t -> HM.key -> S.elt listval succ_e : S.t HM.t -> HM.key -> (HM.key * S.elt) listval map_vertex : (HM.key -> HM.key) -> S.t HM.t -> S.t HM.t
type t = S.t HM.t
val iter_edges : (HM.key -> S.elt -> unit) -> S.t HM.t -> unitval fold_edges : (HM.key -> S.elt -> 'a -> 'a) -> S.t HM.t -> 'a -> 'aval iter_edges_e : ((HM.key * S.elt) -> unit) -> S.t HM.t -> unitval fold_edges_e : ((HM.key * S.elt) -> 'a -> 'a) -> S.t HM.t -> 'a -> 'aval iter_pred : (V.t -> unit) -> S.t HM.t -> V.t -> unitval fold_pred : (V.t -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'aval pred : S.t HM.t -> V.t -> V.t listval in_degree : S.t HM.t -> V.t -> intval iter_pred_e : ((V.t * V.t) -> unit) -> S.t HM.t -> V.t -> unitval fold_pred_e : ((V.t * V.t) -> 'a -> 'a) -> S.t HM.t -> V.t -> 'a -> 'aval pred_e : S.t HM.t -> V.t -> (V.t * V.t) list