13#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_SPLITS_NUMBER_SWEEP_HPP
14#define MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_SPLITS_NUMBER_SWEEP_HPP
30template<
typename SplitPolicy>
49 template<
typename TreeType>
53 typename TreeType::ElemType& axisCut);
63 template<
typename TreeType>
67 typename TreeType::ElemType& axisCut);
74#include "minimal_splits_number_sweep_impl.hpp"
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
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.
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.
Linear algebra utility functions, generally performed on matrices or vectors.
A struct that provides the type of the sweep cost.