\section{Class List}
Here are the classes, structs, unions and interfaces with brief descriptions\-:\begin{DoxyCompactList}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_a_star_graph_search}{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 $>$} }{\pageref{class_odin_a_i_1_1_a_star_graph_search}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_atomic_goal}{Odin\-A\-I\-::\-Atomic\-Goal} }{\pageref{class_odin_a_i_1_1_atomic_goal}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_base_goal}{Odin\-A\-I\-::\-Base\-Goal} }{\pageref{class_odin_a_i_1_1_base_goal}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_composite_goal}{Odin\-A\-I\-::\-Composite\-Goal} }{\pageref{class_odin_a_i_1_1_composite_goal}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_sparse_graph_1_1_const_edge_iterator}{Odin\-A\-I\-::\-Sparse\-Graph$<$ N\-O\-D\-E\-\_\-\-T\-Y\-P\-E, E\-D\-G\-E\-\_\-\-T\-Y\-P\-E $>$\-::\-Const\-Edge\-Iterator} }{\pageref{class_odin_a_i_1_1_sparse_graph_1_1_const_edge_iterator}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_sparse_graph_1_1_const_node_iterator}{Odin\-A\-I\-::\-Sparse\-Graph$<$ N\-O\-D\-E\-\_\-\-T\-Y\-P\-E, E\-D\-G\-E\-\_\-\-T\-Y\-P\-E $>$\-::\-Const\-Node\-Iterator} }{\pageref{class_odin_a_i_1_1_sparse_graph_1_1_const_node_iterator}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_dijkstra_graph_search}{Odin\-A\-I\-::\-Dijkstra\-Graph\-Search$<$ Graph\-Type, Target\-Condition $>$} \\*Given a graph, and an optional target, it calculates the shortest path from the source node to the target }{\pageref{class_odin_a_i_1_1_dijkstra_graph_search}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_sparse_graph_1_1_edge_iterator}{Odin\-A\-I\-::\-Sparse\-Graph$<$ N\-O\-D\-E\-\_\-\-T\-Y\-P\-E, E\-D\-G\-E\-\_\-\-T\-Y\-P\-E $>$\-::\-Edge\-Iterator} }{\pageref{class_odin_a_i_1_1_sparse_graph_1_1_edge_iterator}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_event}{Odin\-A\-I\-::\-Event} }{\pageref{class_odin_a_i_1_1_event}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_event_manager}{Odin\-A\-I\-::\-Event\-Manager} }{\pageref{class_odin_a_i_1_1_event_manager}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_graph_edge}{Odin\-A\-I\-::\-Graph\-Edge} }{\pageref{class_odin_a_i_1_1_graph_edge}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_graph_node}{Odin\-A\-I\-::\-Graph\-Node} }{\pageref{class_odin_a_i_1_1_graph_node}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_indexed_priority_q_low}{Odin\-A\-I\-::\-Indexed\-Priority\-Q\-Low$<$ T $>$} }{\pageref{class_odin_a_i_1_1_indexed_priority_q_low}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_nav_graph_node}{Odin\-A\-I\-::\-Nav\-Graph\-Node$<$ Vector $>$} }{\pageref{class_odin_a_i_1_1_nav_graph_node}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_network_manager}{Odin\-A\-I\-::\-Network\-Manager} }{\pageref{class_odin_a_i_1_1_network_manager}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_sparse_graph_1_1_node_iterator}{Odin\-A\-I\-::\-Sparse\-Graph$<$ N\-O\-D\-E\-\_\-\-T\-Y\-P\-E, E\-D\-G\-E\-\_\-\-T\-Y\-P\-E $>$\-::\-Node\-Iterator} }{\pageref{class_odin_a_i_1_1_sparse_graph_1_1_node_iterator}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_odin_a_i_root}{Odin\-A\-I\-::\-Odin\-A\-I\-Root} }{\pageref{class_odin_a_i_1_1_odin_a_i_root}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_sparse_graph}{Odin\-A\-I\-::\-Sparse\-Graph$<$ N\-O\-D\-E\-\_\-\-T\-Y\-P\-E, E\-D\-G\-E\-\_\-\-T\-Y\-P\-E $>$} }{\pageref{class_odin_a_i_1_1_sparse_graph}}{}
\item\contentsline{section}{\hyperlink{class_odin_a_i_1_1_timer}{Odin\-A\-I\-::\-Timer} }{\pageref{class_odin_a_i_1_1_timer}}{}
\end{DoxyCompactList}
