[mlpack-svn] r12618 - mlpack/trunk/src/mlpack/methods/neighbor_search
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Thu May 3 20:14:44 EDT 2012
Author: rcurtin
Date: 2012-05-03 20:14:44 -0400 (Thu, 03 May 2012)
New Revision: 12618
Modified:
mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
Log:
Use the tree's preferred traverser type.
Modified: mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
===================================================================
--- mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp 2012-05-04 00:14:29 UTC (rev 12617)
+++ mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp 2012-05-04 00:14:44 UTC (rev 12618)
@@ -11,6 +11,7 @@
#include <mlpack/core.hpp>
#include <mlpack/core/tree/traversers/single_tree_depth_first_traverser.hpp>
+#include <mlpack/core/tree/traversers/single_tree_breadth_first_traverser.hpp>
#include "neighbor_search_rules.hpp"
using namespace mlpack::neighbor;
@@ -190,8 +191,8 @@
querySet, *neighborPtr, *distancePtr, metric);
// Create the traverser.
- tree::SingleTreeDepthFirstTraverser<TreeType,
- NeighborSearchRules<SortPolicy, MetricType, TreeType> >
+ typename TreeType::template PreferredTraverser<
+ NeighborSearchRules<SortPolicy, MetricType, TreeType> >::Type
traverser(rules);
// Now have it traverse for each point.
More information about the mlpack-svn
mailing list