Functor Avl_kernel.Make_acyclic

module Make_acyclic: functor (X : GRAPH_acyclic) -> sig  end
X : Avl_kernel.GRAPH_acyclic

exception Cyclic
val fold : 'a -> (X.node -> X.node -> 'a -> 'a) -> X.graph -> 'a
fold g computes the transitive reduction of the graph g. The graph g is supposed to be acyclic, otherwise the exception Cyclic is raised. The function returns the set of edges of the resulting graph. This set is computed thanks to parameters empty and add: