14#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_SINGLE_TREE_TRAVERSER_HPP
15#define MLPACK_CORE_TREE_RECTANGLE_TREE_SINGLE_TREE_TRAVERSER_HPP
24template<
typename MetricType,
25 typename StatisticType,
29 template<
typename>
class AuxiliaryInformationType>
30template<
typename RuleType>
63 static bool NodeComparator(
const NodeAndScore& obj1,
const NodeAndScore& obj2)
65 return obj1.score < obj2.score;
79#include "single_tree_traverser_impl.hpp"
A single traverser for rectangle type trees.
void Traverse(const size_t queryIndex, const RectangleTree &referenceNode)
Traverse the tree with the given point.
size_t NumPrunes() const
Get the number of prunes.
size_t & NumPrunes()
Modify the number of prunes.
SingleTreeTraverser(RuleType &rule)
Instantiate the traverser with the given rule set.
A rectangle type tree tree, such as an R-tree or X-tree.
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.