[mlpack-svn] [MLPACK] #286: Test RANN with cover tree

[MLPACK Trac]

#286: Test RANN with cover tree
---------------------+------------------------------------------------------
 Reporter:  rcurtin  |        Owner:                                              
     Type:  defect   |       Status:  new                                         
 Priority:  trivial  |    Milestone:  mlpack 1.0.6                                
Component:  mlpack   |     Keywords:  rann, cover tree, descendant, numdescendants
 Blocking:           |   Blocked By:                                              
---------------------+------------------------------------------------------
 The RANeighborSearchRules class does not properly use the Descendant() and
 NumDescendants() functions in its body but instead Begin() and Count() --
 which only work with BinarySpaceTree.

 Those calls should be adapted, which should be simple, and then the RANN
 test should be modified to also test that the cover tree implementation of
 RANN works.

-- 
Ticket URL: <http://trac.research.cc.gatech.edu/fastlab/ticket/286>
MLPACK <www.fast-lab.org>
MLPACK is an intuitive, fast, and scalable C++ machine learning library developed by the FASTLAB at Georgia Tech under Dr. Alex Gray.