mlpack 3.4.2
r_plus_plus_tree_descent_heuristic.hpp
Go to the documentation of this file.
1
13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP
15
16#include <mlpack/prereqs.hpp>
17
18namespace mlpack {
19namespace tree {
20
22{
23 public:
32 template<typename TreeType>
33 static size_t ChooseDescentNode(TreeType* node, const size_t point);
34
43 template<typename TreeType>
44 static size_t ChooseDescentNode(const TreeType* node,
45 const TreeType* insertedNode);
46};
47
48} // namespace tree
49} // namespace mlpack
50
51#include "r_plus_plus_tree_descent_heuristic_impl.hpp"
52
53#endif // MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP
static size_t ChooseDescentNode(const TreeType *node, const TreeType *insertedNode)
Evaluate the node using a heuristic.
static size_t ChooseDescentNode(TreeType *node, const size_t point)
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.