.TH "/var/www/mlpack.ratml.org/mlpack.org/_src/mlpack-3.3.2/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep.hpp" 3 "Mon Aug 31 2020" "Version 3.3.2" "mlpack" \" -*- nroff -*-
.ad l
.nh
.SH NAME
/var/www/mlpack.ratml.org/mlpack.org/_src/mlpack-3.3.2/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep.hpp
.SH SYNOPSIS
.br
.PP
.SS "Classes"

.in +1c
.ti -1c
.RI "class \fBMinimalSplitsNumberSweep< SplitPolicy >\fP"
.br
.RI "The \fBMinimalSplitsNumberSweep\fP class finds a partition along which we can split a node according to the number of required splits of the node\&. "
.ti -1c
.RI "struct \fBMinimalSplitsNumberSweep< SplitPolicy >::SweepCost< typename >\fP"
.br
.RI "A struct that provides the type of the sweep cost\&. "
.in -1c
.SS "Namespaces"

.in +1c
.ti -1c
.RI " \fBmlpack\fP"
.br
.RI "Linear algebra utility functions, generally performed on matrices or vectors\&. "
.ti -1c
.RI " \fBmlpack::tree\fP"
.br
.RI "Trees and tree-building procedures\&. "
.in -1c
.SH "Detailed Description"
.PP 

.PP
\fBAuthor:\fP
.RS 4
Mikhail Lozhnikov
.RE
.PP
Definition of the MinimalSplitsNumberSweep class, a class that finds a partition of a node along an axis\&.
.PP
mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license\&. You should have received a copy of the 3-clause BSD license along with mlpack\&. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information\&. 
.PP
Definition in file \fBminimal_splits_number_sweep\&.hpp\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for mlpack from the source code\&.