matrix.setValue(5,4,0.8f);
vector<float> asw(5);
asw[0]=0.170833f;
asw[1]=0.309722f;
asw[2]=0.306412f;
asw[3]=0.125744f;
asw[4]=0;
vector< BinaryTreeNode > tree;
tree.push_back(BinaryTreeNode(1,2,0.3f));
tree.push_back(BinaryTreeNode(3,4,0.4f));
tree.push_back(BinaryTreeNode(0,1,0.5f));
tree.push_back(BinaryTreeNode(0,3,0.6f));
tree.push_back(BinaryTreeNode(0,5,0.7f));
vector<float> result = ptr->averageSilhouetteWidth(tree, matrix);
TEST_EQUAL(result.size(), asw.size());
for (Size i = 0; i < result.size(); ++i)
{
TOLERANCE_ABSOLUTE(0.001);
TEST_REAL_SIMILAR(result[i], asw[i]);
}
}
END_SECTION
START_SECTION((std::vector< float > dunnIndices(const std::vector<BinaryTreeNode>& tree, const DistanceMatrix<float>& original, const bool tree_from_singlelinkage = false)))
{
DistanceMatrix<float> matrix(6,666);
matrix.setValue(1,0,0.5f);
matrix.setValue(2,0,0.8f);
