5 /***********************************************************************/
7 CompleteLinkage::CompleteLinkage(RAbundVector* rav, ListVector* lv, SparseMatrix* dm) :
11 /***********************************************************************/
12 //This function clusters based on the furthest neighbor method.
13 void CompleteLinkage::update(){
17 vector<int> found(nColCells, 0);
19 for(int i=1;i<nRowCells;i++){
23 if(rowCells[i]->row == smallRow){
24 search = rowCells[i]->column;
27 search = rowCells[i]->row;
30 for(int j=1;j<nColCells;j++){
32 if(colCells[j]->row == search || colCells[j]->column == search){
34 if(colCells[j]->dist < rowCells[i]->dist){
35 colCells[j]->dist = rowCells[i]->dist;
37 if(colCells[j]->vectorMap != NULL){
38 *(colCells[j]->vectorMap) = NULL;
39 colCells[j]->vectorMap = NULL;
48 dMatrix->rmCell(rowCells[i]);
54 for(int i=0;i<nColCells;i++){
56 dMatrix->rmCell(colCells[i]);
61 errorOut(e, "CompleteLinkage", "update");
66 /***********************************************************************/