22 #ifndef __MLPACK_CORE_TREE_COVER_TREE_DUAL_TREE_TRAVERSER_HPP
23 #define __MLPACK_CORE_TREE_COVER_TREE_DUAL_TREE_TRAVERSER_HPP
32 template<
typename MetricType,
typename RootPo
intPolicy,
typename StatisticType>
35 template<
typename MetricType,
typename RootPo
intPolicy,
typename StatisticType>
36 template<
typename RuleType>
37 class CoverTree<MetricType, RootPointPolicy, StatisticType>::DualTreeTraverser
43 DualTreeTraverser(RuleType& rule);
58 MetricType, RootPointPolicy, StatisticType> > >&
82 MetricType, RootPointPolicy, StatisticType> > >&
85 MetricType, RootPointPolicy, StatisticType> > >& childMap);
87 void ReferenceRecursion(
CoverTree& queryNode,
89 MetricType, RootPointPolicy, StatisticType> > >&
97 #include "dual_tree_traverser_impl.hpp"
size_t & NumPrunes()
Modify the number of pruned nodes.
Forward declaration of struct to be used for traversal.
size_t numPrunes
The number of pruned nodes.
RuleType & rule
The instantiated rule set for pruning branches.
size_t NumBaseCases() const
size_t NumVisited() const
size_t NumPrunes() const
Get the number of pruned nodes.
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensi...