\section{Paradis\-EO Class List}
Here are the classes, structs, unions and interfaces with brief descriptions:\begin{CompactList}
\item\contentsline{section}{\bf{City\-Swap} (Its swaps two vertices randomly choosen )}{\pageref{class_city_swap}}{}
\item\contentsline{section}{\bf{Communicable} }{\pageref{class_communicable}}{}
\item\contentsline{section}{\bf{Communicator} }{\pageref{class_communicator}}{}
\item\contentsline{section}{\bf{Cooperative} }{\pageref{class_cooperative}}{}
\item\contentsline{section}{\bf{Display\-Best\-Route} }{\pageref{class_display_best_route}}{}
\item\contentsline{section}{\bf{Edge\-Xover} (Edge Crossover )}{\pageref{class_edge_xover}}{}
\item\contentsline{section}{\bf{Merge\-Route\-Eval} }{\pageref{class_merge_route_eval}}{}
\item\contentsline{section}{\bf{Node} }{\pageref{struct_node}}{}
\item\contentsline{section}{\bf{Order\-Xover} (Order Crossover )}{\pageref{class_order_xover}}{}
\item\contentsline{section}{\bf{Partial\-Mapped\-Xover} (Partial Mapped Crossover )}{\pageref{class_partial_mapped_xover}}{}
\item\contentsline{section}{\bf{Part\-Route\-Eval} (Route Evaluator )}{\pageref{class_part_route_eval}}{}
\item\contentsline{section}{\bf{peo\-Agg\-Eval\-Func$<$ EOT $>$} (The \doxyref{peo\-Agg\-Eval\-Func}{p.}{classpeo_agg_eval_func} class offers only the interface for creating aggregate evaluation functions - there are no direct internal functions provided )}{\pageref{classpeo_agg_eval_func}}{}
\item\contentsline{section}{\bf{peo\-Async\-Island\-Mig$<$ EOT $>$} (The \doxyref{peo\-Async\-Island\-Mig}{p.}{classpeo_async_island_mig} class offers the elementary basis for implementating an asynchronous island migration model - requires the specification of several basic parameters, i.e )}{\pageref{classpeo_async_island_mig}}{}
\item\contentsline{section}{\bf{peo\-EA$<$ EOT $>$} (The \doxyref{peo\-EA}{p.}{classpeo_e_a} class offers an elementary evolutionary algorithm implementation )}{\pageref{classpeo_e_a}}{}
\item\contentsline{section}{\bf{peo\-No\-Agg\-Eval\-Func$<$ EOT $>$} (The \doxyref{peo\-No\-Agg\-Eval\-Func}{p.}{classpeo_no_agg_eval_func} class does nothing more than an association between a fitness value and a specified individual )}{\pageref{classpeo_no_agg_eval_func}}{}
\item\contentsline{section}{\bf{peo\-Para\-Pop\-Eval$<$ EOT $>$} (The \doxyref{peo\-Para\-Pop\-Eval}{p.}{classpeo_para_pop_eval} represents a wrapper for creating a functor capable of applying in parallel an EO-derived evaluation functor )}{\pageref{classpeo_para_pop_eval}}{}
\item\contentsline{section}{\bf{peo\-Para\-SGATransform$<$ EOT $>$} }{\pageref{classpeo_para_s_g_a_transform}}{}
\item\contentsline{section}{\bf{peo\-Pop\-Eval$<$ EOT $>$} (The {\bf \doxyref{peo\-Pop\-Eval}{p.}{classpeo_pop_eval}} class provides the interface for constructing Paradis\-EO specific evaluation functors )}{\pageref{classpeo_pop_eval}}{}
\item\contentsline{section}{\bf{peo\-Seq\-Pop\-Eval$<$ EOT $>$} (The \doxyref{peo\-Seq\-Pop\-Eval}{p.}{classpeo_seq_pop_eval} class acts only as a Paradis\-EO specific sequential evaluation functor - a wrapper for incorporating an {\bf eo\-Eval\-Func$<$ EOT $>$}-derived class as evaluation functor )}{\pageref{classpeo_seq_pop_eval}}{}
\item\contentsline{section}{\bf{peo\-Seq\-Transform$<$ EOT $>$} (The \doxyref{peo\-Seq\-Transform}{p.}{classpeo_seq_transform} represent a wrapper for offering the possibility of using EO derived transform operators along with the Paradis\-EO evolutionary algorithms )}{\pageref{classpeo_seq_transform}}{}
\item\contentsline{section}{\bf{peo\-Sync\-Island\-Mig$<$ EOT $>$} (The \doxyref{peo\-Sync\-Island\-Mig}{p.}{classpeo_sync_island_mig} class offers the elementary basis for implementating a synchronous island migration model - requires the specification of several basic parameters, i.e )}{\pageref{classpeo_sync_island_mig}}{}
\item\contentsline{section}{\bf{peo\-Sync\-Multi\-Start$<$ EOT $>$} (The \doxyref{peo\-Sync\-Multi\-Start}{p.}{classpeo_sync_multi_start} class provides the basis for implementing the synchronous multi-start model, for launching several solution-based algorithms in parallel on a specified initial population )}{\pageref{classpeo_sync_multi_start}}{}
\item\contentsline{section}{\bf{peo\-Transform$<$ EOT $>$} (The \doxyref{peo\-Transform}{p.}{classpeo_transform} class acts only as an interface for creating transform operators - for an example please refer to the {\bf \doxyref{peo\-Seq\-Transform}{p.}{classpeo_seq_transform}} and the {\bf \doxyref{peo\-Para\-SGATransform}{p.}{classpeo_para_s_g_a_transform}} classes )}{\pageref{classpeo_transform}}{}
\item\contentsline{section}{\bf{Reactive\-Thread} }{\pageref{class_reactive_thread}}{}
\item\contentsline{section}{\bf{Ring\-Topology} }{\pageref{class_ring_topology}}{}
\item\contentsline{section}{\bf{Route\-Eval} }{\pageref{class_route_eval}}{}
\item\contentsline{section}{\bf{Route\-Init} }{\pageref{class_route_init}}{}
\item\contentsline{section}{\bf{Runner} }{\pageref{class_runner}}{}
\item\contentsline{section}{\bf{SEND\_\-REQUEST} }{\pageref{struct_s_e_n_d___r_e_q_u_e_s_t}}{}
\item\contentsline{section}{\bf{Service} }{\pageref{class_service}}{}
\item\contentsline{section}{\bf{Thread} }{\pageref{class_thread}}{}
\item\contentsline{section}{\bf{Topology} }{\pageref{class_topology}}{}
\item\contentsline{section}{\bf{Two\-Opt} }{\pageref{class_two_opt}}{}
\item\contentsline{section}{\bf{Two\-Opt\-Incr\-Eval} }{\pageref{class_two_opt_incr_eval}}{}
\item\contentsline{section}{\bf{Two\-Opt\-Init} }{\pageref{class_two_opt_init}}{}
\item\contentsline{section}{\bf{Two\-Opt\-Next} }{\pageref{class_two_opt_next}}{}
\item\contentsline{section}{\bf{Two\-Opt\-Rand} }{\pageref{class_two_opt_rand}}{}
\item\contentsline{section}{\bf{Worker} }{\pageref{class_worker}}{}
\end{CompactList}
