Functor Avl_closure.Make

module Make: functor (X : GRAPH) -> sig  end

val fold : 'a -> (X.node -> X.node -> 'a -> 'a) -> X.graph -> 'a

fold empty add g computes the strict transitive closure of the graph g. The function returns the set of edges of the resulting graph. This set is computed thanks to parameters empty and add:

• empty is the empty initial set,
• add nd1 nd2 s returns the set obtained by adding the edge nd1 -> nd2 to the set s.