forked from mothur/mothur
-
Notifications
You must be signed in to change notification settings - Fork 0
/
averagelinkage.cpp
56 lines (43 loc) · 1.55 KB
/
averagelinkage.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#ifndef AVERAGE_H
#define AVERAGE_H
//test
#include "mothur.h"
#include "cluster.hpp"
#include "rabundvector.hpp"
#include "sparsedistancematrix.h"
/* This class implements the average UPGMA, average neighbor clustering algorithm */
/***********************************************************************/
AverageLinkage::AverageLinkage(RAbundVector* rav, ListVector* lv, SparseDistanceMatrix* dm, float c, string s, float a) :
Cluster(rav, lv, dm, c, s, a)
{
saveRow = -1;
saveCol = -1;
}
/***********************************************************************/
//This function returns the tag of the method.
string AverageLinkage::getTag() {
return("an");
}
/***********************************************************************/
//This function updates the distance based on the average linkage method.
bool AverageLinkage::updateDistance(PDistCell& colCell, PDistCell& rowCell) {
try {
if ((saveRow != smallRow) || (saveCol != smallCol)) {
rowBin = rabund->get(smallRow);
colBin = rabund->get(smallCol);
totalBin = rowBin + colBin;
saveRow = smallRow;
saveCol = smallCol;
}
//cout << "colcell.dist = " << colCell.dist << '\t' << smallRow << '\t' << smallCol << '\t' << rowCell.dist << endl;
colCell.dist = (colBin * colCell.dist + rowBin * rowCell.dist) / totalBin;
return(true);
}
catch(exception& e) {
m->errorOut(e, "AverageLinkage", "updateDistance");
exit(1);
}
}
/***********************************************************************/
/***********************************************************************/
#endif