30 #include "WDataSetHierarchicalClustering.h"
41 std::map< size_t, WFiberCluster::SPtr > allClusters )
64 return "DataSetHierarchicalClustering";
69 return "A tree of fiber clusters.";
85 std::vector< WTreeNode::SPtr > result;
87 if( node->level() <= level )
89 result.push_back( node );
93 for(
size_t i = 0; i < node->getChildren().size(); i++ )
96 result.reserve( result.size() + c.size() );
97 result.insert( result.end(), c.begin(), c.end() );