[mlpack-git] [mlpack/mlpack] General greedy traverser. (#762)

[MarcosPividori]

> +  template<typename VecType>
> +  BinarySpaceTree& GetFurthestChild(
> +      const VecType& point,
> +      typename boost::enable_if<IsVector<VecType> >::type* = 0);
> +
> +  /**
> +   * Return the nearest child node to the given query node.  If it can't decide
> +   * it will return a null pointer.
> +   */
> +  BinarySpaceTree* GetNearestChild(const BinarySpaceTree& queryNode);
> +
> +  /**
> +   * Return the furthest child node to the given query node.  If it can't decide
> +   * it will return a null pointer.
> +   */
> +  BinarySpaceTree* GetFurthestChild(const BinarySpaceTree& queryNode);

@rcurtin  The overloads of spill trees are used for `DefeatistDualTreeTraverser`. Also, all of these overloads will be used when implementing a greedy dual tree traverser.
I agree that it is best to return an index. I have updated the code in: https://github.com/mlpack/mlpack/pull/762/commits/8e305125edbc85f6f037fbb01b081509153641ff
Thanks!

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/762/files/f8ddd58ece06362024944a6533f68074a6b27ef7#r75571196
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160819/90872a4e/attachment-0001.html>