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
|
#ifndef WEIGHTEDLINKAGE_H
#define WEIGHTEDLINKAGE_H
#include "mothur.h"
#include "cluster.hpp"
#include "rabundvector.hpp"
/* This class implements the WPGMA, weighted average neighbor clustering algorithm */
/***********************************************************************/
WeightedLinkage::WeightedLinkage(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 WeightedLinkage::getTag() {
return("wn");
}
/***********************************************************************/
//This function updates the distance based on the average linkage method.
bool WeightedLinkage::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;
}
colCell.dist = (colCell.dist + rowCell.dist) / 2.0;
return(true);
}
catch(exception& e) {
m->errorOut(e, "WeightedLinkage", "updateDistance");
exit(1);
}
}
/***********************************************************************/
/***********************************************************************/
#endif
|
