\section{/var/www/mlpack.ratml.\+org/mlpack.org/\+\_\+src/mlpack-\/3.3.1/src/mlpack/core/tree/binary\+\_\+space\+\_\+tree/breadth\+\_\+first\+\_\+dual\+\_\+tree\+\_\+traverser.hpp File Reference}
\label{breadth__first__dual__tree__traverser_8hpp}\index{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+1/src/mlpack/core/tree/binary\+\_\+space\+\_\+tree/breadth\+\_\+first\+\_\+dual\+\_\+tree\+\_\+traverser.\+hpp@{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+1/src/mlpack/core/tree/binary\+\_\+space\+\_\+tree/breadth\+\_\+first\+\_\+dual\+\_\+tree\+\_\+traverser.\+hpp}}
Include dependency graph for breadth\+\_\+first\+\_\+dual\+\_\+tree\+\_\+traverser.\+hpp\+:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{breadth__first__dual__tree__traverser_8hpp__incl}
\end{center}
\end{figure}
This graph shows which files directly or indirectly include this file\+:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{breadth__first__dual__tree__traverser_8hpp__dep__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ Binary\+Space\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Bound\+Type, Split\+Type $>$\+::\+Breadth\+First\+Dual\+Tree\+Traverser$<$ Rule\+Type $>$}
\item 
struct \textbf{ Queue\+Frame$<$ Tree\+Type, Traversal\+Info\+Type $>$}
\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \textbf{ mlpack}
\begin{DoxyCompactList}\small\item\em strip\+\_\+type.\+hpp \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::tree}
\begin{DoxyCompactList}\small\item\em Trees and tree-\/building procedures. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Ryan Curtin
\end{DoxyAuthor}
Defines the Breadth\+First\+Dual\+Tree\+Traverser for the Binary\+Space\+Tree tree type. This is a nested class of Binary\+Space\+Tree which traverses two trees in a breadth-\/first manner with a given set of rules which indicate the branches which can be pruned and the order in which to recurse.

mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-\/clause B\+SD license. You should have received a copy of the 3-\/clause B\+SD license along with mlpack. If not, see {\tt http\+://www.\+opensource.\+org/licenses/\+B\+S\+D-\/3-\/\+Clause} for more information.