view release on metacpan or  search on metacpan

perl/t/12_treecluster.t  view on Meta::CPAN

$node = $tree->get(9);
is ($node->left, 8);
is ($node->right, -9);
is (sprintf("%7.3f", $node->distance), "  3.234");

$node = $tree->get(10);
is ($node->left, -6);
is ($node->right, 6);
is (sprintf("%7.3f", $node->distance), "  4.636");

$node = $tree->get(11);
is ($node->left, -11);
is ($node->right, -10);
is (sprintf("%7.3f", $node->distance), " 12.741");



#--------------[PSLcluster]-------
$params{method} = 's';

$tree = Algorithm::Cluster::treecluster(%params);

# Make sure that @clusters and @centroids are the right length
is (scalar(@$data2) - 1, $tree->length );


$node = $tree->get(0);
is ($node->left, 4);
is ($node->right, 5);
is (sprintf("%7.3f", $node->distance), "  0.003");

$node = $tree->get(1);
is ($node->left, 9);
is ($node->right, 12);
is (sprintf("%7.3f", $node->distance), "  0.029");

$node = $tree->get(2);
is ($node->left, 11);
is ($node->right, -2);
is (sprintf("%7.3f", $node->distance), "  0.033");

$node = $tree->get(3);
is ($node->left, 1);
is ($node->right, 2);
is (sprintf("%7.3f", $node->distance), "  0.061");

$node = $tree->get(4);
is ($node->left, 10);
is ($node->right, -3);
is (sprintf("%7.3f", $node->distance), "  0.077");

$node = $tree->get(5);
is ($node->left, 7);
is ($node->right, -5);
is (sprintf("%7.3f", $node->distance), "  0.092");

$node = $tree->get(6);
is ($node->left, 0);
is ($node->right, -4);
is (sprintf("%7.3f", $node->distance), "  0.242");

$node = $tree->get(7);
is ($node->left, -7);
is ($node->right, -1);
is (sprintf("%7.3f", $node->distance), "  0.246");

$node = $tree->get(8);
is ($node->left, 3);
is ($node->right, -8);
is (sprintf("%7.3f", $node->distance), "  0.287");

$node = $tree->get(9);
is ($node->left, -9);
is ($node->right, 8);
is (sprintf("%7.3f", $node->distance), "  1.936");

$node = $tree->get(10);
is ($node->left, -10);
is ($node->right, -6);
is (sprintf("%7.3f", $node->distance), "  3.432");

$node = $tree->get(11);
is ($node->left, 6);
is ($node->right, -11);
is (sprintf("%7.3f", $node->distance), "  3.535");


#--------------[PCLcluster]-------
$params{method} = 'c';

$tree = Algorithm::Cluster::treecluster(%params);

# Make sure that @clusters and @centroids are the right length
is (scalar(@$data2) - 1, $tree->length );



$node = $tree->get(0);
is ($node->left, 4);
is ($node->right, 5);
is (sprintf("%7.3f", $node->distance), "  0.003");

$node = $tree->get(1);
is ($node->left, 12);
is ($node->right, 9);
is (sprintf("%7.3f", $node->distance), "  0.029");

$node = $tree->get(2);
is ($node->left, 1);
is ($node->right, 2);
is (sprintf("%7.3f", $node->distance), "  0.061");

$node = $tree->get(3);
is ($node->left, -2);
is ($node->right, 11);
is (sprintf("%7.3f", $node->distance), "  0.063");

$node = $tree->get(4);
is ($node->left, 10);
is ($node->right, -4);
is (sprintf("%7.3f", $node->distance), "  0.109");

$node = $tree->get(5);
is ($node->left, -5);
is ($node->right, 7);