r_star_tree_descent_heuristic.hpp
Go to the documentation of this file.
1 
13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_DESCENT_HEURISTIC_HPP
14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_R_STAR_TREE_DESCENT_HEURISTIC_HPP
15 
16 #include <mlpack/prereqs.hpp>
17 
18 namespace mlpack {
19 namespace tree {
20 
27 {
28  public:
39  template<typename TreeType>
40  static size_t ChooseDescentNode(const TreeType* node, const size_t point);
41 
42  template<typename TreeType>
43  static size_t ChooseDescentNode(const TreeType* node,
44  const TreeType* insertedNode);
45 };
46 
47 } // namespace tree
48 } // namespace mlpack
49 
50 // Include implementation.
51 #include "r_star_tree_descent_heuristic_impl.hpp"
52 
53 #endif
static size_t ChooseDescentNode(const TreeType *node, const size_t point)
Evaluate the node using a heuristic.
strip_type.hpp
Definition: add_to_po.hpp:21
The core includes that mlpack expects; standard C++ includes and Armadillo.
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...