findMaxDist(top);
}
+ /**
+ * Returns the minimum distance between two clusters, and also sets the
+ * indices of the clusters in fields mini and minj
+ *
+ * @return
+ */
protected abstract double findMinDistance();
/**
}
/**
- * DOCUMENT ME!
+ * Finds the node, at or below the given node, with the maximum distance, and
+ * saves the node and the distance value
*
* @param nd
- * DOCUMENT ME!
*/
void findMaxDist(SequenceNode nd)
{
}
/**
- * DOCUMENT ME!
+ * Calculates and returns r, whatever that is
*
* @param i
- * DOCUMENT ME!
* @param j
- * DOCUMENT ME!
*
- * @return DOCUMENT ME!
+ * @return
*/
protected double findr(int i, int j)
{
done.set(j);
}
- protected abstract void findNewDistances(SequenceNode tmpi, SequenceNode tmpj,
- double dist);
+ /*
+ * Computes and stores new distances for nodei and nodej, given the previous
+ * distance between them
+ */
+ protected abstract void findNewDistances(SequenceNode nodei,
+ SequenceNode nodej, double previousDistance);
/**
* Calculates and saves the distance between the combination of cluster(i) and