[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)

[lozhnikov]

> +
> +    // Before recursing, we have to set the traversal information correctly.
> +    rule.TraversalInfo() = traversalInfo;
> +    const double rightScore = rule.Score(*queryNode.Right(), referenceNode);
> +    ++numScores;
> +
> +    if (rightScore != DBL_MAX)
> +      Traverse(*queryNode.Right(), referenceNode);
> +    else
> +      ++numPrunes;
> +  }
> +  else if (queryNode.IsLeaf() && (!referenceNode.IsLeaf()))
> +  {
> +    // If the reference node contains a point we should calculate all
> +    // base cases with this point.
> +    if (referenceNode.IsFirstPointCentroid())

If the reference node contains a point we have to calculate all base cases.

---
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/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71836926
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160722/1b7c2ebe/attachment.html>