\section{Greedy\+Single\+Tree\+Traverser$<$ Tree\+Type, Rule\+Type $>$ Class Template Reference}
\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser}\index{Greedy\+Single\+Tree\+Traverser$<$ Tree\+Type, Rule\+Type $>$@{Greedy\+Single\+Tree\+Traverser$<$ Tree\+Type, Rule\+Type $>$}}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\textbf{ Greedy\+Single\+Tree\+Traverser} (Rule\+Type \&rule)
\begin{DoxyCompactList}\small\item\em Instantiate the greedy single tree traverser with the given rule set. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Min\+Base\+Cases} ()
\begin{DoxyCompactList}\small\item\em Set value of min\+Base\+Cases. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Min\+Base\+Cases} () const
\begin{DoxyCompactList}\small\item\em Get value of min\+Base\+Cases. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Num\+Prunes} () const
\begin{DoxyCompactList}\small\item\em Get the number of prunes. \end{DoxyCompactList}\item 
void \textbf{ Traverse} (const size\+\_\+t query\+Index, Tree\+Type \&reference\+Node)
\begin{DoxyCompactList}\small\item\em Traverse the tree with the given point. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename Tree\+Type, typename Rule\+Type$>$\newline
class mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser$<$ Tree\+Type, Rule\+Type $>$}



Definition at line 23 of file greedy\+\_\+single\+\_\+tree\+\_\+traverser.\+hpp.



\subsection{Constructor \& Destructor Documentation}
\mbox{\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser_ab381f1601c6a3b0bd886aeba34de89b9}} 
\index{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}!Greedy\+Single\+Tree\+Traverser@{Greedy\+Single\+Tree\+Traverser}}
\index{Greedy\+Single\+Tree\+Traverser@{Greedy\+Single\+Tree\+Traverser}!mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}}
\subsubsection{Greedy\+Single\+Tree\+Traverser()}
{\footnotesize\ttfamily \textbf{ Greedy\+Single\+Tree\+Traverser} (\begin{DoxyParamCaption}\item[{Rule\+Type \&}]{rule }\end{DoxyParamCaption})}



Instantiate the greedy single tree traverser with the given rule set. 



\subsection{Member Function Documentation}
\mbox{\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser_ab8fb6a0170ff1cb26938b54fad69635a}} 
\index{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}!Min\+Base\+Cases@{Min\+Base\+Cases}}
\index{Min\+Base\+Cases@{Min\+Base\+Cases}!mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}}
\subsubsection{Min\+Base\+Cases()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Min\+Base\+Cases (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Set value of min\+Base\+Cases. 



Definition at line 44 of file greedy\+\_\+single\+\_\+tree\+\_\+traverser.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser_a4e365c3fe92140d7ea27aeff47a0b71f}} 
\index{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}!Min\+Base\+Cases@{Min\+Base\+Cases}}
\index{Min\+Base\+Cases@{Min\+Base\+Cases}!mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}}
\subsubsection{Min\+Base\+Cases()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t Min\+Base\+Cases (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Get value of min\+Base\+Cases. 



Definition at line 47 of file greedy\+\_\+single\+\_\+tree\+\_\+traverser.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser_ac2f6072011ee31a0a32f62e2a105a347}} 
\index{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}!Num\+Prunes@{Num\+Prunes}}
\index{Num\+Prunes@{Num\+Prunes}!mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}}
\subsubsection{Num\+Prunes()}
{\footnotesize\ttfamily size\+\_\+t Num\+Prunes (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Get the number of prunes. 



Definition at line 41 of file greedy\+\_\+single\+\_\+tree\+\_\+traverser.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1GreedySingleTreeTraverser_a794b07d567369c4b56e958a21c27531b}} 
\index{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}!Traverse@{Traverse}}
\index{Traverse@{Traverse}!mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser@{mlpack\+::tree\+::\+Greedy\+Single\+Tree\+Traverser}}
\subsubsection{Traverse()}
{\footnotesize\ttfamily void Traverse (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{query\+Index,  }\item[{Tree\+Type \&}]{reference\+Node }\end{DoxyParamCaption})}



Traverse the tree with the given point. 


\begin{DoxyParams}{Parameters}
{\em query\+Index} & The index of the point in the query set which is being used as the query point. \\
\hline
{\em reference\+Node} & The tree node to be traversed. \\
\hline
\end{DoxyParams}


The documentation for this class was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+2/src/mlpack/core/tree/\textbf{ greedy\+\_\+single\+\_\+tree\+\_\+traverser.\+hpp}\end{DoxyCompactItemize}