package fix

  1. Overview
  2. Docs

The signature GRAPH describes a directed, rooted graph. It is used by GraphNumbering.Make and friends.

type t

The type of vertices.

val foreach_root : (t -> unit) -> unit

foreach_root yield must call yield x at least once for every vertex x that is considered a root (an entry point) of the graph. It may call yield x several times at a single vertex x.

val foreach_successor : t -> (t -> unit) -> unit

foreach_successor x yield must call yield y for every vertex y that is a successor of the vertex x in the graph.

OCaml

Innovation. Community. Security.