14#ifndef MLPACK_CORE_TREE_COVER_TREE_SINGLE_TREE_TRAVERSER_HPP
15#define MLPACK_CORE_TREE_COVER_TREE_SINGLE_TREE_TRAVERSER_HPP
26 typename StatisticType,
28 typename RootPointPolicy
30template<
typename RuleType>
31class CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::
66#include "single_tree_traverser_impl.hpp"
A single-tree cover tree traverser; see single_tree_traverser.hpp for implementation.
void Traverse(const size_t queryIndex, CoverTree &referenceNode)
Traverse the tree with the given point.
size_t NumPrunes() const
Get the number of prunes so far.
size_t & NumPrunes()
Set the number of prunes (good for a reset to 0).
SingleTreeTraverser(RuleType &rule)
Initialize the single tree traverser with the given rule.
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensi...
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.