.TH "/var/www/mlpack.ratml.org/mlpack.org/_src/mlpack-3.3.1/src/mlpack/core/tree/spill_tree/spill_single_tree_traverser.hpp" 3 "Sun Aug 30 2020" "Version 3.1.1" "mlpack" \" -*- nroff -*-
.ad l
.nh
.SH NAME
/var/www/mlpack.ratml.org/mlpack.org/_src/mlpack-3.3.1/src/mlpack/core/tree/spill_tree/spill_single_tree_traverser.hpp
.SH SYNOPSIS
.br
.PP
.SS "Classes"

.in +1c
.ti -1c
.RI "class \fBSpillTree< MetricType, StatisticType, MatType, HyperplaneType, SplitType >::SpillSingleTreeTraverser< MetricType, StatisticType, MatType, HyperplaneType, SplitType >\fP"
.br
.RI "A generic single-tree traverser for hybrid spill trees; see \fBspill_single_tree_traverser\&.hpp\fP for implementation\&. "
.in -1c
.SS "Namespaces"

.in +1c
.ti -1c
.RI " \fBmlpack\fP"
.br
.RI "strip_type\&.hpp "
.ti -1c
.RI " \fBmlpack::tree\fP"
.br
.RI "Trees and tree-building procedures\&. "
.in -1c
.SH "Detailed Description"
.PP 

.PP
\fBAuthor:\fP
.RS 4
Ryan Curtin 
.PP
Marcos Pividori
.RE
.PP
A nested class of SpillTree which traverses the entire tree with a given set of rules which indicate the branches which can be pruned and the order in which to recurse\&. This traverser is a depth-first traverser\&. The Defeatist template parameter determines if the traversers must do defeatist search on overlapping nodes\&.
.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 \fBspill_single_tree_traverser\&.hpp\fP\&.
.SH "Author"
.PP 
Generated automatically by Doxygen for mlpack from the source code\&.