mlpack
|
A dual tree traverser for rectangle type trees. More...
#include <rectangle_tree.hpp>
Public Member Functions | |
DualTreeTraverser (RuleType &rule) | |
Instantiate the dual-tree traverser with the given rule set. | |
void | Traverse (RectangleTree &queryNode, RectangleTree &referenceNode) |
Traverse the two trees. More... | |
size_t | NumPrunes () const |
Get the number of prunes. | |
size_t & | NumPrunes () |
Modify the number of prunes. | |
size_t | NumVisited () const |
Get the number of visited combinations. | |
size_t & | NumVisited () |
Modify the number of visited combinations. | |
size_t | NumScores () const |
Get the number of times a node combination was scored. | |
size_t & | NumScores () |
Modify the number of times a node combination was scored. | |
size_t | NumBaseCases () const |
Get the number of times a base case was calculated. | |
size_t & | NumBaseCases () |
Modify the number of times a base case was calculated. | |
A dual tree traverser for rectangle type trees.
void mlpack::tree::RectangleTree< MetricType, StatisticType, MatType, SplitType, DescentType, AuxiliaryInformationType >::DualTreeTraverser< RuleType >::Traverse | ( | RectangleTree & | queryNode, |
RectangleTree & | referenceNode | ||
) |
Traverse the two trees.
This does not reset the number of prunes.
queryNode | The query node to be traversed. |
referenceNode | The reference node to be traversed. |