#ifndef LEMON_TABU_SEARCH_H

 #ifndef LEMON_TABU_SEARCH_H

 #define LEMON_TABU_SEARCH_H

 #define LEMON_TABU_SEARCH_H

 /// \file

 /// \file

 /// \brief TabuSearch algorithm.

 /// \brief TabuSearch algorithm.

 ///

 ///

 /// \author Szabadkai Mark

 /// \author Szabadkai Mark

     }

     }

   };

   };

   /// \brief TabuSearch main class

   /// \brief TabuSearch main class

   ///

   ///

   /// This class offers the implementation of tabu-search algorithm. The

   /// This class offers the implementation of tabu-search algorithm. The

   /// tabu-serach is a local-search. It starts from a specified point of the

   /// tabu-serach is a local-search. It starts from a specified point of the

   /// problem's graph representation, and in every step it goes to the localy

   /// problem's graph representation, and in every step it goes to the localy