mlpack 3.4.2
hilbert_r_tree_descent_heuristic.hpp
Go to the documentation of this file.
1
13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_HR_TREE_DESCENT_HEURISTIC_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_HR_TREE_DESCENT_HEURISTIC_HPP
15
16#include <mlpack/prereqs.hpp>
17
18namespace mlpack {
19namespace tree {
20
27{
28 public:
37 template<typename TreeType>
38 static size_t ChooseDescentNode(const TreeType* node, const size_t point);
39
48 template<typename TreeType>
49 static size_t ChooseDescentNode(const TreeType* node,
50 const TreeType* insertedNode);
51};
52
53} // namespace tree
54} // namespace mlpack
55
56#include "hilbert_r_tree_descent_heuristic_impl.hpp"
57
58#endif // MLPACK_CORE_TREE_RECTANGLE_TREE_HR_TREE_DESCENT_HEURISTIC_HPP
This class chooses the best child of a node in a Hilbert R tree when inserting a new point.
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.