Aakash-kaushik/mlpack/r__plus__plus__tree__descent__heuristic_8hpp_source.html

 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP
 #define MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP

 #include <mlpack/prereqs.hpp>

 namespace mlpack {
 namespace tree {

 class RPlusPlusTreeDescentHeuristic
 {
  public:
   template<typename TreeType>
   static size_t ChooseDescentNode(TreeType* node, const size_t point);

   template<typename TreeType>
   static size_t ChooseDescentNode(const TreeType* node,
                                   const TreeType* insertedNode);
 };

 } // namespace tree
 } // namespace mlpack

 #include "r_plus_plus_tree_descent_heuristic_impl.hpp"

 #endif // MLPACK_CORE_TREE_RECTANGLE_TREE_RPP_TREE_DESCENT_HEURISTIC_HPP
r_plus_plus_tree_descent_heuristic_impl.hpp

mlpack
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1

prereqs.hpp
The core includes that mlpack expects; standard C++ includes and Armadillo.

mlpack::tree::RPlusPlusTreeDescentHeuristic::ChooseDescentNode
static size_t ChooseDescentNode(TreeType *node, const size_t point)
Evaluate the node using a heuristic.
Definition: r_plus_plus_tree_descent_heuristic_impl.hpp:23

mlpack::tree::RPlusPlusTreeDescentHeuristic
Definition: r_plus_plus_tree_descent_heuristic.hpp:21