|class||BinarySpaceTree< MetricType, StatisticType, MatType, BoundType, SplitType >::BreadthFirstDualTreeTraverser< RuleType >|
|struct||QueueFrame< TreeType, TraversalInfoType >|
Linear algebra utility functions, generally performed on matrices or vectors.
Trees and tree-building procedures.
Defines the BreadthFirstDualTreeTraverser for the BinarySpaceTree tree type. This is a nested class of BinarySpaceTree which traverses two trees in a breadth-first manner with a given set of rules which indicate the branches which can be pruned and the order in which to recurse.
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 breadth_first_dual_tree_traverser.hpp.