package prbnmcn-stats

  1. Overview
  2. Docs

We use an OCamlgraph-compatible module type to describe undirected graphs. We assume that all graphs are undirected and simple.

type t
type vertex = V.t
type edge
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val succ : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a