<p>In <a href="https://github.com/mlpack/mlpack/pull/708#discussion_r71837324">src/mlpack/core/tree/vantage_point_tree/dual_tree_traverser_impl.hpp</a>:</p>
<pre style='color:#555'>> + if (rightScore != DBL_MAX)
> + {
> + // Restore the right traversal info.
> + rule.TraversalInfo() = traversalInfo;
> + Traverse(queryNode, *referenceNode.Right());
> + }
> + else
> + ++numPrunes;
> + }
> + }
> + }
> + else
> + {
> + // If the reference node contains a point we should calculate all
> + // base cases with this point.
> + if (referenceNode.IsFirstPointCentroid())
</pre>
<p>I think this is inefficient. Is it possible to implement the score algorithm for a reference point and a query node?</p>
<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">—<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly, <a href="https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71837324">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFAIFT-Co2hiWGdrlIz9Hx3kmIa_vks5qYHHjgaJpZM4I_COp">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFPK7AfJyhVFRk_1nILwhqO2Sbncaks5qYHHjgaJpZM4I_COp.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
<div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
<link itemprop="url" href="https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71837324"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>