|
mlpack
|
A generic dual-tree traverser for hybrid spill trees; see spill_dual_tree_traverser.hpp for implementation. More...
Public Member Functions | |
| SpillDualTreeTraverser (RuleType &rule) | |
| Instantiate the dual-tree traverser with the given rule set. | |
| void | Traverse (SpillTree &queryNode, SpillTree &referenceNode, const bool bruteForce=false) |
| 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 generic dual-tree traverser for hybrid spill trees; see spill_dual_tree_traverser.hpp for implementation.
The Defeatist template parameter determines if the traverser must do defeatist search on overlapping nodes.
| void mlpack::tree::SpillTree< MetricType, StatisticType, MatType, HyperplaneType, SplitType >::SpillDualTreeTraverser< RuleType, Defeatist >::Traverse | ( | SpillTree & | queryNode, |
| SpillTree & | referenceNode, | ||
| const bool | bruteForce = false |
||
| ) |
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. |
| bruteForce | If true, then do a brute-force search on the reference node instead of traversing any further. |
1.8.13