14 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_DUAL_TREE_TRAVERSER_HPP
15 #define MLPACK_CORE_TREE_RECTANGLE_TREE_DUAL_TREE_TRAVERSER_HPP
24 template<
typename MetricType,
25 typename StatisticType,
29 template<
typename>
class AuxiliaryInformationType>
30 template<
typename RuleType>
77 typename RuleType::TraversalInfoType travInfo;
80 static bool nodeComparator(
const NodeAndScore& obj1,
81 const NodeAndScore& obj2)
83 return obj1.score < obj2.score;
103 typename RuleType::TraversalInfoType traversalInfo;
110 #include "dual_tree_traverser_impl.hpp"
size_t & NumPrunes()
Modify the number of prunes.
The core includes that mlpack expects; standard C++ includes and Armadillo.
size_t & NumVisited()
Modify the number of visited combinations.
size_t NumVisited() const
Get the number of visited combinations.
A rectangle type tree tree, such as an R-tree or X-tree.
size_t & NumScores()
Modify the number of times a node combination was scored.
A dual tree traverser for rectangle type trees.
size_t & NumBaseCases()
Modify the number of times a base case was calculated.
size_t NumBaseCases() const
Get the number of times a base case was calculated.
size_t NumScores() const
Get the number of times a node combination was scored.
size_t NumPrunes() const
Get the number of prunes.