\hypertarget{class_s_c_i_run_algo_1_1_find_closest_node_algo}{\section{Find\-Closest\-Node\-Algo Class Reference}
\label{class_s_c_i_run_algo_1_1_find_closest_node_algo}\index{Find\-Closest\-Node\-Algo@{Find\-Closest\-Node\-Algo}}
}


{\ttfamily \#include $<$Find\-Closest\-Node.\-h$>$}

Inheritance diagram for Find\-Closest\-Node\-Algo\-:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[height=2.000000cm]{class_s_c_i_run_algo_1_1_find_closest_node_algo}
\end{center}
\end{figure}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{class_s_c_i_run_algo_1_1_find_closest_node_algo_a8fd62f7f2318a26b3514d68fe448a724}{Find\-Closest\-Node\-Algo} ()
\begin{DoxyCompactList}\small\item\em Set defaults. \end{DoxyCompactList}\item 
bool \hyperlink{class_s_c_i_run_algo_1_1_find_closest_node_algo_abafdb463ed3c0a2303e018ee03925ed7}{run} (\hyperlink{namespace_s_c_i_run_ae62efffc02ce1c5a899048c76e4411bd}{Field\-Handle} input, \hyperlink{namespace_s_c_i_run_ae62efffc02ce1c5a899048c76e4411bd}{Field\-Handle} points, std\-::vector$<$ \hyperlink{namespace_s_c_i_run_a24ade047e7536e188f5ea3a9d93c5ced}{index\-\_\-type} $>$ \&nodes)
\begin{DoxyCompactList}\small\item\em run the algorithm \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Constructor \& Destructor Documentation}
\hypertarget{class_s_c_i_run_algo_1_1_find_closest_node_algo_a8fd62f7f2318a26b3514d68fe448a724}{\index{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo@{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo}!Find\-Closest\-Node\-Algo@{Find\-Closest\-Node\-Algo}}
\index{Find\-Closest\-Node\-Algo@{Find\-Closest\-Node\-Algo}!SCIRunAlgo::FindClosestNodeAlgo@{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo}}
\subsubsection[{Find\-Closest\-Node\-Algo}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Find\-Closest\-Node\-Algo} (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
)\hspace{0.3cm}{\ttfamily [inline]}}}\label{class_s_c_i_run_algo_1_1_find_closest_node_algo_a8fd62f7f2318a26b3514d68fe448a724}


Set defaults. 



\subsection{Member Function Documentation}
\hypertarget{class_s_c_i_run_algo_1_1_find_closest_node_algo_abafdb463ed3c0a2303e018ee03925ed7}{\index{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo@{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo}!run@{run}}
\index{run@{run}!SCIRunAlgo::FindClosestNodeAlgo@{S\-C\-I\-Run\-Algo\-::\-Find\-Closest\-Node\-Algo}}
\subsubsection[{run}]{\setlength{\rightskip}{0pt plus 5cm}bool run (
\begin{DoxyParamCaption}
\item[{{\bf Field\-Handle}}]{input, }
\item[{{\bf Field\-Handle}}]{points, }
\item[{std\-::vector$<$ {\bf index\-\_\-type} $>$ \&}]{nodes}
\end{DoxyParamCaption}
)}}\label{class_s_c_i_run_algo_1_1_find_closest_node_algo_abafdb463ed3c0a2303e018ee03925ed7}


run the algorithm 



The documentation for this class was generated from the following files\-:\begin{DoxyCompactItemize}
\item 
Core/\-Algorithms/\-Legacy/\-Fields/\-Find\-Nodes/\hyperlink{_find_closest_node_8h}{Find\-Closest\-Node.\-h}\item 
Core/\-Algorithms/\-Legacy/\-Fields/\-Find\-Nodes/\hyperlink{_find_closest_node_8cc}{Find\-Closest\-Node.\-cc}\end{DoxyCompactItemize}
