mlpack
Public Types | Public Member Functions | List of all members
mlpack::tree::BinarySpaceTree< MetricType, StatisticType, MatType, BoundType, SplitType >::BreadthFirstDualTreeTraverser< RuleType > Class Template Reference

Public Types

typedef QueueFrame< BinarySpaceTree, typename RuleType::TraversalInfoType > QueueFrameType
 

Public Member Functions

 BreadthFirstDualTreeTraverser (RuleType &rule)
 Instantiate the dual-tree traverser with the given rule set.
 
void Traverse (BinarySpaceTree &queryNode, BinarySpaceTree &referenceNode)
 Traverse the two trees. More...
 
void Traverse (BinarySpaceTree &queryNode, std::priority_queue< QueueFrameType > &referenceQueue)
 
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.
 

Member Function Documentation

◆ Traverse()

template<typename MetricType , typename StatisticType , typename MatType , template< typename BoundMetricType, typename... > class BoundType, template< typename SplitBoundType, typename SplitMatType > class SplitType>
template<typename RuleType >
void mlpack::tree::BinarySpaceTree< MetricType, StatisticType, MatType, BoundType, SplitType >::BreadthFirstDualTreeTraverser< RuleType >::Traverse ( BinarySpaceTree queryNode,
BinarySpaceTree referenceNode 
)

Traverse the two trees.

This does not reset the number of prunes.

Parameters
queryNodeThe query node to be traversed.
referenceNodeThe reference node to be traversed.

The documentation for this class was generated from the following files: