\section{/var/www/mlpack.ratml.\+org/mlpack.org/\+\_\+src/mlpack-\/3.3.2/src/mlpack/core/tree/enumerate\+\_\+tree.hpp File Reference}
\label{enumerate__tree_8hpp}\index{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+2/src/mlpack/core/tree/enumerate\+\_\+tree.\+hpp@{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+2/src/mlpack/core/tree/enumerate\+\_\+tree.\+hpp}}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \textbf{ mlpack}
\begin{DoxyCompactList}\small\item\em Linear algebra utility functions, generally performed on matrices or vectors. \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::tree}
\begin{DoxyCompactList}\small\item\em Trees and tree-\/building procedures. \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::tree\+::enumerate}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$class Tree\+Type , class Walker $>$ }\\void \textbf{ Enumerate\+Tree} (Tree\+Type $\ast$tree, Walker \&walker)
\begin{DoxyCompactList}\small\item\em Traverses all nodes of the tree, including the inner ones. \end{DoxyCompactList}\item 
{\footnotesize template$<$class Tree\+Type , class Walker $>$ }\\void \textbf{ Enumerate\+Tree\+Impl} (Tree\+Type $\ast$tree, Walker \&walker, bool root)
\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Ivan (Jonan) Georgiev
\end{DoxyAuthor}
This file contains function that performs a simple depth-\/first walk on the tree calling {\ttfamily Enter} and {\ttfamily Leave} methods of a provided walker.

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.