atour.h

#include <scil/scil.h>
#include <scil/core/var_map.h>
#include <scil/core/min_cut.h>
#include <boost/foreach.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/iteration_macros.hpp>

#ifndef ATOUR_H
#define ATOUR_H

namespace SCIL {
template <typename Graph>
class ATOUR : public sym_constraint { 
   private:
      typedef boost::graph_traits<Graph> GraphTraits;
      typedef typename GraphTraits::vertex_descriptor vertex_descriptor;
      typedef typename GraphTraits::edge_descriptor edge_descriptor;
      Graph &G;                 
      var_map<edge_descriptor> &VM;

      status heuristic_separation(subproblem& S);

      status exact_separation(subproblem& S);

  
   class dir_degree_equality;

   class dir_cutset_inequality;
  
   public:
     //For a demo, see: \link ptsp/ptsp.c ptsp.c \endlink .
     ATOUR(Graph& G_, var_map<edge_descriptor>& X);

     void init(subproblem& S);
  
     status standard_separation(subproblem& S);

     status fast_separation(subproblem& S);


     status feasible(solution& S);
     //status feasible(solution& S);

      void info();

};

#include "../../../src/constraints/atour.cc"

}

#endif

---