#include <mlpack/prereqs.hpp>#include <mlpack/core/tree/greedy_single_tree_traverser.hpp>#include "neighbor_search_rules.hpp"#include <mlpack/core/tree/spill_tree/is_spill_tree.hpp>
Include dependency graph for neighbor_search_impl.hpp:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| mlpack | |
| Linear algebra utility functions, generally performed on matrices or vectors. | |
Functions | |
| template<typename TreeType , typename MatType > | |
| TreeType * | mlpack::neighbor::BuildTree (MatType &&dataset, std::vector< size_t > &oldFromNew, typename std::enable_if_t< tree::TreeTraits< TreeType >::RearrangesDataset, TreeType > *=0) |
| Call the tree constructor that does mapping. | |
| template<typename TreeType , typename MatType > | |
| TreeType * | mlpack::neighbor::BuildTree (MatType &&dataset, const std::vector< size_t > &, const typename std::enable_if_t< !tree::TreeTraits< TreeType >::RearrangesDataset, TreeType > *=0) |
| Call the tree constructor that does not do mapping. | |
Detailed Description
Implementation of Neighbor-Search class to perform all-nearest-neighbors on two specified data sets.
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.
