[mlpack-svn] r10049 - in mlpack/trunk/src/mlpack/methods: emst neighbor_search

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: 2011-10-26 20:15:12 -0400 (Wed, 26 Oct 2011)
New Revision: 10049

Modified:
   mlpack/trunk/src/mlpack/methods/emst/dtb.hpp
   mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search.h
Log:
Update includes of binary_search_tree.hpp.


Modified: mlpack/trunk/src/mlpack/methods/emst/dtb.hpp
===================================================================
--- mlpack/trunk/src/mlpack/methods/emst/dtb.hpp	2011-10-27 00:14:52 UTC (rev 10048)
+++ mlpack/trunk/src/mlpack/methods/emst/dtb.hpp	2011-10-27 00:15:12 UTC (rev 10049)
@@ -4,10 +4,10 @@
  * @author Bill March (march at gatech.edu)
  *
  * Contains an implementation of the DualTreeBoruvka algorithm for finding a
- * Euclidean Minimum Spanning Tree.  
+ * Euclidean Minimum Spanning Tree.
  *
  * Citation: March, W. B.; Ram, P.; and Gray, A. G.  Fast Euclidean Minimum Spanning
- * Tree: Algorithm, Analysis, Applications.  In KDD, 2010.  
+ * Tree: Algorithm, Analysis, Applications.  In KDD, 2010.
  *
  */
 
@@ -18,7 +18,7 @@
 
 #include <mlpack/core.h>
 #include <mlpack/core/tree/bounds.hpp>
-#include <mlpack/core/tree/spacetree.hpp>
+#include <mlpack/core/tree/binary_space_tree.hpp>
 #include <mlpack/core/kernels/lmetric.hpp>
 
 PARAM(size_t, "leaf_size", "Size of the leaves.", "naive", 1, false);

Modified: mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search.h
===================================================================
--- mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search.h	2011-10-27 00:14:52 UTC (rev 10048)
+++ mlpack/trunk/src/mlpack/methods/neighbor_search/neighbor_search.h	2011-10-27 00:15:12 UTC (rev 10049)
@@ -9,7 +9,7 @@
 
 #include <mlpack/core.h>
 #include <mlpack/core/tree/bounds.hpp>
-#include <mlpack/core/tree/spacetree.hpp>
+#include <mlpack/core/tree/binary_space_tree.hpp>
 #include <vector>
 #include <string>