14#ifndef MLPACK_CORE_TREE_BINARY_SPACE_TREE_SINGLE_TREE_TRAVERSER_HPP
15#define MLPACK_CORE_TREE_BINARY_SPACE_TREE_SINGLE_TREE_TRAVERSER_HPP
24template<
typename MetricType,
25 typename StatisticType,
27 template<
typename BoundMetricType,
typename...>
class BoundType,
28 template<
typename SplitBoundType,
typename SplitMatType>
30template<
typename RuleType>
66#include "single_tree_traverser_impl.hpp"
Definition of generalized binary space partitioning tree (BinarySpaceTree).
A single-tree traverser for binary space trees; see single_tree_traverser.hpp for implementation.
size_t NumPrunes() const
Get the number of prunes.
void Traverse(const size_t queryIndex, BinarySpaceTree &referenceNode)
Traverse the tree with the given point.
size_t & NumPrunes()
Modify the number of prunes.
SingleTreeTraverser(RuleType &rule)
Instantiate the single tree traverser with the given rule set.
A binary space partitioning tree, such as a KD-tree or a ball tree.
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.