Module Graph.Descendance

Given two nodes we can determine whether one is an ancestor of the other. We encode the four cases of the result into a variant type named Descendance.t.

type t =
  1. | Same_node
  2. | Strict_ancestor
  3. | Strict_descendant
  4. | Other
val all : t list
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val seeded_hash : int -> t -> int
val sexp_of_t : t -> Sexplib0.Sexp.t