13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_SPLITS_NUMBER_SWEEP_HPP 14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_SPLITS_NUMBER_SWEEP_HPP 30 template<
typename SplitPolicy>
49 template<
typename TreeType>
53 typename TreeType::ElemType& axisCut);
63 template<
typename TreeType>
67 typename TreeType::ElemType& axisCut);
76 #endif // MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_SPLITS_NUMBER_SWEEP_HPP Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1
A struct that provides the type of the sweep cost.
Definition: minimal_splits_number_sweep.hpp:36
static size_t SweepLeafNode(const size_t axis, const TreeType *node, typename TreeType::ElemType &axisCut)
Find a suitable partition of a leaf node along the provided axis.
Definition: minimal_splits_number_sweep_impl.hpp:98
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
Definition: minimal_splits_number_sweep.hpp:31
static size_t SweepNonLeafNode(const size_t axis, const TreeType *node, typename TreeType::ElemType &axisCut)
Find a suitable partition of a non-leaf node along the provided axis.
Definition: minimal_splits_number_sweep_impl.hpp:23