|class||SpillTree< MetricType, StatisticType, MatType, HyperplaneType, SplitType >::SpillDualTreeTraverser< MetricType, StatisticType, MatType, HyperplaneType, SplitType >|
|A generic dual-tree traverser for hybrid spill trees; see spill_dual_tree_traverser.hpp for implementation. More...|
Linear algebra utility functions, generally performed on matrices or vectors.
Trees and tree-building procedures.
Defines the SpillDualTreeTraverser for the SpillTree tree type. This is a nested class of SpillTree which traverses two trees in a depth-first manner with a given set of rules which indicate the branches which can be pruned and the order in which to recurse. The Defeatist template parameter determines if the traversers must do defeatist search on overlapping nodes.
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.
Definition in file spill_dual_tree_traverser.hpp.