<p>In <a href="https://github.com/mlpack/mlpack/pull/708#discussion_r71836802">src/mlpack/core/tree/vantage_point_tree/dual_tree_traverser_impl.hpp</a>:</p>
<pre style='color:#555'>> + for (size_t ref = referenceNode.Begin(); ref < refEnd; ++ref)
> + rule.BaseCase(query, ref);
> +
> + numBaseCases += referenceNode.Count();
> + }
> + }
> + else if (((!queryNode.IsLeaf()) && referenceNode.IsLeaf()) ||
> + (queryNode.NumDescendants() > 3 * referenceNode.NumDescendants() &&
> + !queryNode.IsLeaf() && !referenceNode.IsLeaf()))
> + {
> + // We have to recurse down the query node. In this case the recursion order
> + // does not matter.
> +
> + // If the first point of the query node is the centroid, the query node
> + // contains a point. In this case we should run the single tree traverser.
> + if (queryNode.IsFirstPointCentroid())
</pre>
<p>If the query node contains a point we have to use the single tree traverser.</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#r71836802">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFPBA6Y-TGKXZxG-FgLd8lE9DZlCCks5qYHE9gaJpZM4I_COp">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFJ731IJ5CqTUlN4OFqyTf7vej3Fyks5qYHE9gaJpZM4I_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#r71836802"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>