Cluster::Cluster(RAbundVector* rav, ListVector* lv, SparseMatrix* dm, float c, string f) :
rabund(rav), list(lv), dMatrix(dm), method(f)
{
+ try {
/*
cout << "sizeof(MatData): " << sizeof(MatData) << endl;
cout << "sizeof(PCell*): " << sizeof(PCell*) << endl;
// a list contains pointers (iterators) to the all distances related
// to a certain sequence. The Vector is accessed via the index of a
// sequence in the distance matrix.
-
-
+//ofstream outtemp;
+//string temp = "temp";
+//m->openOutputFile(temp, outtemp);
+//cout << lv->size() << endl;
seqVec = vector<MatVec>(lv->size());
for (MatData currentCell = dMatrix->begin(); currentCell != dMatrix->end(); currentCell++) {
+//outtemp << currentCell->row << '\t' << currentCell->column << '\t' << currentCell->dist << endl;
seqVec[currentCell->row].push_back(currentCell);
seqVec[currentCell->column].push_back(currentCell);
}
-
+//outtemp.close();
mapWanted = false; //set to true by mgcluster to speed up overlap merge
//save so you can modify as it changes in average neighbor
cutoff = c;
m = MothurOut::getInstance();
+
+ }
+ catch(exception& e) {
+ m->errorOut(e, "Cluster", "Cluster");
+ exit(1);
+ }
}
/***********************************************************************/
smallRow = smallCell->row; // get its row
smallCol = smallCell->column; // get its column
smallDist = smallCell->dist; // get the smallest distance
-
+ //cout << "small row = " << smallRow << "small col = " << smallCol << "small dist = " << smallDist << endl;
+
rowCells = seqVec[smallRow]; // all distances related to the row index
colCells = seqVec[smallCol]; // all distances related to the column index
nRowCells = rowCells.size();
nColCells = colCells.size();
+//cout << "num rows = " << nRowCells << "num col = " << nColCells << endl;
+
+ //for (int i = 0; i < nColCells; i++) { cout << colCells[i]->row << '\t' << colCells[i]->column << endl; }
+ //for (int i = 0; i < nRowCells; i++) { cout << rowCells[i]->row << '\t' << rowCells[i]->column << endl; }
}
catch(exception& e) {
m->errorOut(e, "Cluster", "getRowColCells");
seqVec[dcol].erase(seqVec[dcol].begin()+vcol);
if (rmMatrix) {
+ //cout << " removing = " << cell->row << '\t' << cell->column << '\t' << cell->dist << endl;
dMatrix->rmCell(cell);
+ // cout << "done" << endl;
}
}
// The vector has to be traversed in reverse order to preserve the index
// for faster removal in removeCell()
for (int i=nRowCells-1;i>=0;i--) {
+ //if you are not the smallCell
if (!((rowCells[i]->row == smallRow) && (rowCells[i]->column == smallCol))) {
if (rowCells[i]->row == smallRow) {
search = rowCells[i]->column;
}
}
//if not merged it you need it for warning
- if ((!merged) && (method == "average")) {
+ if ((!merged) && (method == "average" || method == "weighted")) {
//m->mothurOut("Warning: trying to merge cell " + toString(rowCells[i]->row+1) + " " + toString(rowCells[i]->column+1) + " distance " + toString(rowCells[i]->dist) + " with value above cutoff. Results may vary from using cutoff at cluster command instead of read.dist."); m->mothurOutEndLine();
if (cutOFF > rowCells[i]->dist) {
cutOFF = rowCells[i]->dist;
// could be avoided
for (int i=nColCells-1;i>=0;i--) {
if (foundCol[i] == 0) {
- if (method == "average") {
+ if (method == "average" || method == "weighted") {
if (!((colCells[i]->row == smallRow) && (colCells[i]->column == smallCol))) {
//m->mothurOut("Warning: merging cell " + toString(colCells[i]->row+1) + " " + toString(colCells[i]->column+1) + " distance " + toString(colCells[i]->dist) + " value above cutoff. Results may vary from using cutoff at cluster command instead of read.dist."); m->mothurOutEndLine();
if (cutOFF > colCells[i]->dist) {