Go to the source code of this file.
Classes | |
class | CoverTree< MetricType, StatisticType, MatType, RootPointPolicy > |
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensional spaces. More... | |
class | CoverTree< MetricType, StatisticType, MatType, RootPointPolicy >::DualTreeTraverser< RuleType > |
A dual-tree cover tree traverser; see dual_tree_traverser.hpp. More... | |
class | CoverTree< MetricType, StatisticType, MatType, RootPointPolicy >::SingleTreeTraverser< RuleType > |
A single-tree cover tree traverser; see single_tree_traverser.hpp for implementation. More... | |
Namespaces | |
mlpack | |
Linear algebra utility functions, generally performed on matrices or vectors. | |
mlpack::tree | |
Trees and tree-building procedures. | |
Definition of CoverTree, which can be used in place of the BinarySpaceTree.
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 cover_tree.hpp.