14#ifndef MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
15#define MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
47template<
template<
typename TreeMetricType,
48 typename TreeStatType,
57 arma::mat>::template DefeatistDualTreeTraverser,
60 arma::mat>::template DefeatistSingleTreeTraverser>;
Extra data for each node in the tree.
The NeighborSearch class is a template class for performing distance-based neighbor searches.
A hybrid spill tree is a variant of binary space trees in which the children of a node can "spill ove...
LMetric< 2, true > EuclideanDistance
The Euclidean (L2) distance.
DefeatistKNN< tree::SPTree > SpillKNN
The SpillKNN class is the k-nearest-neighbors method considering defeatist search on SPTree.
NeighborSearch< FurthestNeighborSort, metric::EuclideanDistance > KFN
The KFN class is the k-furthest-neighbors method.
NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > KNN
The KNN class is the k-nearest-neighbors method.
NearestNS NearestNeighborSort
Linear algebra utility functions, generally performed on matrices or vectors.