delete read;
//create cluster
- if (method == "furthest") { cluster = new CompleteLinkage(rabund, list, distMatrix); }
- else if(method == "nearest"){ cluster = new SingleLinkage(rabund, list, distMatrix); }
- else if(method == "average"){ cluster = new AverageLinkage(rabund, list, distMatrix); }
+ if (method == "furthest") { cluster = new CompleteLinkage(rabund, list, distMatrix, cutoff); }
+ else if(method == "nearest"){ cluster = new SingleLinkage(rabund, list, distMatrix, cutoff); }
+ else if(method == "average"){ cluster = new AverageLinkage(rabund, list, distMatrix, cutoff); }
cluster->setMapWanted(true);
//cluster using cluster classes
sortHclusterFiles(distFile, overlapFile);
//create cluster
- hcluster = new HCluster(rabund, list, method);
+ hcluster = new HCluster(rabund, list, method, distFile, nameMap, cutoff);
hcluster->setMapWanted(true);
vector<seqDist> seqs; seqs.resize(1); // to start loop
- ifstream inHcluster;
- openInputFile(distFile, inHcluster);
+ //ifstream inHcluster;
+ //openInputFile(distFile, inHcluster);
while (seqs.size() != 0){
- seqs = hcluster->getSeqs(inHcluster, nameMap, cutoff);
+ seqs = hcluster->getSeqs();
for (int i = 0; i < seqs.size(); i++) { //-1 means skip me
}
}
}
- inHcluster.close();
+ //inHcluster.close();
if(previousDist <= 0.0000){
oldList.setLabel("unique");