\section{mlpack\+:\+:emst Namespace Reference}
\label{namespacemlpack_1_1emst}\index{mlpack\+::emst@{mlpack\+::emst}}


Euclidean Minimum Spanning Trees.  


\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ D\+T\+B\+Rules}
\item 
class \textbf{ D\+T\+B\+Stat}
\begin{DoxyCompactList}\small\item\em A statistic for use with mlpack trees, which stores the upper bound on distance to nearest neighbors and the component which this node belongs to. \end{DoxyCompactList}\item 
class \textbf{ Dual\+Tree\+Boruvka}
\begin{DoxyCompactList}\small\item\em Performs the M\+ST calculation using the Dual-\/\+Tree Boruvka algorithm, using any type of tree. \end{DoxyCompactList}\item 
class \textbf{ Edge\+Pair}
\begin{DoxyCompactList}\small\item\em An edge pair is simply two indices and a distance. \end{DoxyCompactList}\item 
class \textbf{ Union\+Find}
\begin{DoxyCompactList}\small\item\em A Union-\/\+Find data structure. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
Euclidean Minimum Spanning Trees. 

