14 #ifndef __MLPACK_CORE_TREE_COVER_TREE_DUAL_TREE_TRAVERSER_HPP 15 #define __MLPACK_CORE_TREE_COVER_TREE_DUAL_TREE_TRAVERSER_HPP 25 typename StatisticType,
27 typename RootPointPolicy
29 template<
typename RuleType>
30 class CoverTree<MetricType, StatisticType, MatType, RootPointPolicy>::
37 DualTreeTraverser(RuleType& rule);
81 if (score == other.
score)
84 return (score < other.
score);
92 std::map<
int, std::vector<DualCoverTreeMapEntry> >&
97 std::map<
int, std::vector<DualCoverTreeMapEntry> >&
99 std::map<
int, std::vector<DualCoverTreeMapEntry> >&
102 void ReferenceRecursion(
CoverTree& queryNode,
103 std::map<
int, std::vector<DualCoverTreeMapEntry> >&
111 #include "dual_tree_traverser_impl.hpp" CoverTree()
A default constructor.
size_t NumPrunes() const
Get the number of pruned nodes.
Linear algebra utility functions, generally performed on matrices or vectors.
size_t NumVisited() const
size_t NumBaseCases() const
CoverTree< MetricType, StatisticType, MatType, RootPointPolicy > * referenceNode
The node this entry refers to.
bool operator<(const DualCoverTreeMapEntry &other) const
Comparison operator, for sorting within the map.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
double baseCase
The base case.
size_t numPrunes
The number of pruned nodes.
RuleType & rule
The instantiated rule set for pruning branches.
RuleType::TraversalInfoType traversalInfo
The traversal info associated with the call to Score() for this entry.
Struct used for traversal.
size_t & NumPrunes()
Modify the number of pruned nodes.
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensi...
double score
The score of the node.