module UnionFind: sig
.. end
This module offers a purely functional implementation of Tarjan's
data structure for solving the union-find problem.
Items.
module type Item = sig
.. end
Descriptors.
module type Desc = sig
.. end
module type S = sig
.. end
Invocation.
module Make: functor (
Item
:
Item
) ->
functor (
Desc
:
Desc
) ->
S
with type item = Item.t
and type descriptor = Desc.descriptor
and type accumulator = Desc.accumulator