<p>In <a href="https://github.com/mlpack/mlpack/pull/708#discussion_r71837406">src/mlpack/core/tree/vantage_point_tree/dual_tree_traverser_impl.hpp</a>:</p>
<pre style='color:#555'>> + {
> + for (size_t i = 0; i < queryNode.NumDescendants(); ++i)
> + rule.BaseCase(queryNode.Descendant(i), referenceNode.Point(0));
> + numBaseCases += queryNode.NumDescendants();
> + }
> + // We have to recurse down both query and reference nodes. Because the
> + // query descent order does not matter, we will go to the left query child
> + // first. Before recursing, we have to set the traversal information
> + // correctly.
> +
> + double leftScore;
> + typename RuleType::TraversalInfoType leftInfo;
> + double rightScore;
> + typename RuleType::TraversalInfoType rightInfo;
> +
> + if (queryNode.IsFirstPointCentroid())
</pre>
<p>Use the single tree traverser if the query node contains a point.</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#r71837406">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFFCJVcADH5HbvtFt7aHRAKCYZRPmks5qYHIZgaJpZM4I_COp">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFLcDFbvK_GYdJq8fHzAQbgXamTXPks5qYHIZgaJpZM4I_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#r71837406"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>