for (int i = 0; i < n - 1; i++) { height[i] = fp.getNearestPair(merge[i]); linkage.merge(merge[i][0], merge[i][1]); // merge clusters into one fp.remove(merge[i][1]); // drop b fp.updatePoint(merge[i][0]); // and tell closest pairs about merger
for (int i = 0; i < n - 1; i++) { height[i] = fp.getNearestPair(merge[i]); linkage.merge(merge[i][0], merge[i][1]); // merge clusters into one fp.remove(merge[i][1]); // drop b fp.updatePoint(merge[i][0]); // and tell closest pairs about merger