edge_xover.h

/* 
* <edge_xover.h>
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
* (C) OPAC Team, LIFL, 2002-2007
*
* Sébastien Cahon, Jean-Charles Boisson
*
* This software is governed by the CeCILL license under French law and
* abiding by the rules of distribution of free software.  You can  use,
* modify and/ or redistribute the software under the terms of the CeCILL
* license as circulated by CEA, CNRS and INRIA at the following URL
* "http://www.cecill.info".
*
* As a counterpart to the access to the source code and  rights to copy,
* modify and redistribute granted by the license, users are provided only
* with a limited warranty  and the software's author,  the holder of the
* economic rights,  and the successive licensors  have only  limited liability.
*
* In this respect, the user's attention is drawn to the risks associated
* with loading,  using,  modifying and/or developing or reproducing the
* software by the user in light of its specific status of free software,
* that may mean  that it is complicated to manipulate,  and  that  also
* therefore means  that it is reserved for developers  and  experienced
* professionals having in-depth computer knowledge. Users are therefore
* encouraged to load and test the software's suitability as regards their
* requirements in conditions enabling the security of their systems and/or
* data to be ensured and,  more generally, to use and operate it in the
* same conditions as regards security.
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL license and that you accept its terms.
*
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
* Contact: paradiseo-help@lists.gforge.inria.fr
*
*/

#ifndef edge_xover_h
#define edge_xover_h

#include <vector>
#include <set>

#include <eoOp.h>

#include "route.h"

class EdgeXover : public eoQuadOp <Route> 
{
  
public :
  
  bool operator () (Route & __route1, Route & __route2) ;

private :
  
  void cross (const Route & __par1, const Route & __par2, Route & __child) ; /* Binary */

  void remove_entry (unsigned int __vertex, std :: vector <std :: set <unsigned> > & __map) ;
  /* Updating the map of entries */

  void build_map (const Route & __par1, const Route & __par2) ;

  void add_vertex (unsigned int __vertex, Route & __child) ;

  std :: vector <std :: set <unsigned int> > _map ; /* The handled map */

  std :: vector <bool> visited ; /* Vertices that are already visited */

} ;

#endif

---