\hypertarget{class_odin_a_i_1_1_a_star_graph_search}{\section{Odin\-A\-I\-:\-:A\-Star\-Graph\-Search$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$ Class Template Reference}
\label{class_odin_a_i_1_1_a_star_graph_search}\index{Odin\-A\-I\-::\-A\-Star\-Graph\-Search$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$}}
}


{\ttfamily \#include $<$A\-Star\-Graph\-Search.\-h$>$}

\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hypertarget{class_odin_a_i_1_1_a_star_graph_search_a03f75ffe4d80bf337fde076f1a147cf1}{{\bfseries A\-Star\-Graph\-Search} (const G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E \&graph, int source\-Node, int target\-Node)}\label{class_odin_a_i_1_1_a_star_graph_search_a03f75ffe4d80bf337fde076f1a147cf1}

\item 
std\-::vector$<$ const Edge $\ast$ $>$ \hyperlink{class_odin_a_i_1_1_a_star_graph_search_a8453848f7be400b5af9c80e779c7eb5c}{Get\-S\-P\-T} () const 
\item 
void \hyperlink{class_odin_a_i_1_1_a_star_graph_search_af912d9c35d0eaad437369bd5e4297f97}{Get\-Path} (std\-::list$<$ int $>$ \&out\-Path) const 
\item 
double \hyperlink{class_odin_a_i_1_1_a_star_graph_search_a31932e70084bc4517fa914a00b1802cf}{Get\-Cost\-To\-Target} () const 
\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$class G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, class H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E$>$class Odin\-A\-I\-::\-A\-Star\-Graph\-Search$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$}

Do a A$\ast$ graph search. Implementation is based on the book\-: Programming Game A\-I by Example. 

\subsection{Member Function Documentation}
\hypertarget{class_odin_a_i_1_1_a_star_graph_search_a31932e70084bc4517fa914a00b1802cf}{\index{Odin\-A\-I\-::\-A\-Star\-Graph\-Search@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}!Get\-Cost\-To\-Target@{Get\-Cost\-To\-Target}}
\index{Get\-Cost\-To\-Target@{Get\-Cost\-To\-Target}!OdinAI::AStarGraphSearch@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}}
\subsubsection[{Get\-Cost\-To\-Target}]{\setlength{\rightskip}{0pt plus 5cm}template$<$class G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E , class H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$ double {\bf Odin\-A\-I\-::\-A\-Star\-Graph\-Search}$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$\-::Get\-Cost\-To\-Target (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily [inline]}}}\label{class_odin_a_i_1_1_a_star_graph_search_a31932e70084bc4517fa914a00b1802cf}
Returns the cost to the target. \hypertarget{class_odin_a_i_1_1_a_star_graph_search_af912d9c35d0eaad437369bd5e4297f97}{\index{Odin\-A\-I\-::\-A\-Star\-Graph\-Search@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}!Get\-Path@{Get\-Path}}
\index{Get\-Path@{Get\-Path}!OdinAI::AStarGraphSearch@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}}
\subsubsection[{Get\-Path}]{\setlength{\rightskip}{0pt plus 5cm}template$<$class G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E , class H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$ void {\bf Odin\-A\-I\-::\-A\-Star\-Graph\-Search}$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$\-::Get\-Path (
\begin{DoxyParamCaption}
\item[{std\-::list$<$ int $>$ \&}]{out\-Path}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily [inline]}}}\label{class_odin_a_i_1_1_a_star_graph_search_af912d9c35d0eaad437369bd5e4297f97}
Fills an list with node data to the specific target. \hypertarget{class_odin_a_i_1_1_a_star_graph_search_a8453848f7be400b5af9c80e779c7eb5c}{\index{Odin\-A\-I\-::\-A\-Star\-Graph\-Search@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}!Get\-S\-P\-T@{Get\-S\-P\-T}}
\index{Get\-S\-P\-T@{Get\-S\-P\-T}!OdinAI::AStarGraphSearch@{Odin\-A\-I\-::\-A\-Star\-Graph\-Search}}
\subsubsection[{Get\-S\-P\-T}]{\setlength{\rightskip}{0pt plus 5cm}template$<$class G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E , class H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$ std\-::vector$<$const Edge$\ast$$>$ {\bf Odin\-A\-I\-::\-A\-Star\-Graph\-Search}$<$ G\-R\-A\-P\-H\-\_\-\-T\-Y\-P\-E, H\-E\-U\-R\-I\-S\-T\-I\-C\-\_\-\-T\-Y\-P\-E $>$\-::Get\-S\-P\-T (
\begin{DoxyParamCaption}
{}
\end{DoxyParamCaption}
) const\hspace{0.3cm}{\ttfamily [inline]}}}\label{class_odin_a_i_1_1_a_star_graph_search_a8453848f7be400b5af9c80e779c7eb5c}
Returns the vector of edges that the algorithm has examined. 

The documentation for this class was generated from the following file\-:\begin{DoxyCompactItemize}
\item 
E\-:/\-Development/\-Projects/\-Odin\-A\-I/\-Include/\-Odin\-A\-I/A\-Star\-Graph\-Search.\-h\end{DoxyCompactItemize}
