module GraphOper: functor (
G
:
Graph.Sig.I
) ->
sig
.. end
generic operation over imperative graphs
transitive reduction. Uses the transitive reduction algorithm from The
Transitive Reduction of a Directed Graph, Aho, Garey and Ullman, 1972 -
with the proviso that we know that our graph already is a transitive
closure
val transitive_reduction : G.t -> unit
module O: Graph.Oper.I
(
G
)