mlpack 3.4.2
r_tree_descent_heuristic.hpp
Go to the documentation of this file.
1
13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_DESCENT_HEURISTIC_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_DESCENT_HEURISTIC_HPP
15
16#include <mlpack/prereqs.hpp>
17
18namespace mlpack {
19namespace tree {
20
27{
28 public:
39 template<typename TreeType>
40 static size_t ChooseDescentNode(const TreeType* node, const size_t point);
41
52 template<typename TreeType>
53 static size_t ChooseDescentNode(const TreeType* node,
54 const TreeType* insertedNode);
55};
56
57} // namespace tree
58} // namespace mlpack
59
60// Include implementation.
61#include "r_tree_descent_heuristic_impl.hpp"
62
63#endif
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
static size_t ChooseDescentNode(const TreeType *node, const size_t point)
Evaluate the node using a heuristic.
static size_t ChooseDescentNode(const TreeType *node, const TreeType *insertedNode)
Evaluate the node using a heuristic.
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1
The core includes that mlpack expects; standard C++ includes and Armadillo.