This module allows computing the transitive closure of a directed
graph. Given a graph G = (X, E), the strict transitive closure
of G is the graph G' = (X, E') such that there is an edge
from x to y in G' if and only if there is a non-empty
path from x to y in G.
module type GRAPH =
functor (X : GRAPH) -> sig end