How to use

findBest

method

in

de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AnderbergHierarchicalClustering

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow upate.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow update.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow update.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}

findBest(size, scratch, bestd, besti, y);

findBest(size, mat.matrix, bestd, besti, y);

findBest(size, mat.matrix, bestd, besti, y);