13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_DESCENT_HEURISTIC_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_R_TREE_DESCENT_HEURISTIC_HPP
39 template<
typename TreeType>
52 template<
typename TreeType>
54 const TreeType* insertedNode);
61#include "r_tree_descent_heuristic_impl.hpp"
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.
The core includes that mlpack expects; standard C++ includes and Armadillo.