Start with
= {{x1}, …, {xn}} and d({xi}, {xj}) = d(xi, xj) for all i ≠ j.
The chain is empty.
-
For l = 1, …, n − 1:
If chain is empty, choose an arbitrary G ∈
; otherwise, let G be the current end of the chain.
Grow a nearest-neighbor chain from G until an RNN pair (G1, G2) is found.
Update
=
∪ {G1 ∪ G2} \ {G1, G2}.
Calculate d(G1 ∪ G2, H) for all H ∈
.
Remove G1 and G2 from the chain.
|