/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

   "4 6    11\n"

   "4 6    11\n"

   "4 7    12\n"

   "4 7    12\n"

   "5 6    13\n"

   "5 6    13\n"

   "5 7    14\n"

   "5 7    14\n"

   "6 7    15\n";

   "6 7    15\n";

 // Check with general graphs

 // Check with general graphs

 template <typename Param>

 template <typename Param>

 void checkMaxCliqueGeneral(Param rule) {

 void checkMaxCliqueGeneral(Param rule) {

   typedef ListGraph GR;

   typedef ListGraph GR;

   typedef GrossoLocatelliPullanMc<GR> McAlg;

   typedef GrossoLocatelliPullanMc<GR> McAlg;

   typedef McAlg::CliqueNodeIt CliqueIt;

   typedef McAlg::CliqueNodeIt CliqueIt;

   // Basic tests

   // Basic tests

   {

   {

     GR g;

     GR g;

     GR::NodeMap<bool> map(g);

     GR::NodeMap<bool> map(g);

     McAlg mc(g);

     McAlg mc(g);

     mc.cliqueMap(map);

     mc.cliqueMap(map);

     check(map[u], "Wrong clique map");

     check(map[u], "Wrong clique map");

     CliqueIt it1(mc);

     CliqueIt it1(mc);

     check(static_cast<GR::Node>(it1) == u && ++it1 == INVALID,

     check(static_cast<GR::Node>(it1) == u && ++it1 == INVALID,

           "Wrong CliqueNodeIt");

           "Wrong CliqueNodeIt");

     GR::Node v = g.addNode();

     GR::Node v = g.addNode();

     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");

     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");

     check(mc.cliqueSize() == 1, "Wrong clique size");

     check(mc.cliqueSize() == 1, "Wrong clique size");

     mc.cliqueMap(map);

     mc.cliqueMap(map);

     check((map[u] && !map[v]) || (map[v] && !map[u]), "Wrong clique map");

     check((map[u] && !map[v]) || (map[v] && !map[u]), "Wrong clique map");

     GR::NodeMap<bool> map(g);

     GR::NodeMap<bool> map(g);

     std::istringstream input(test_lgf);

     std::istringstream input(test_lgf);

     graphReader(g, input)

     graphReader(g, input)

       .nodeMap("max_clique", max_clique)

       .nodeMap("max_clique", max_clique)

       .run();

       .run();

     McAlg mc(g);

     McAlg mc(g);

     mc.iterationLimit(50);

     mc.iterationLimit(50);

     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");

     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");

     check(mc.cliqueSize() == 4, "Wrong clique size");

     check(mc.cliqueSize() == 4, "Wrong clique size");

     mc.cliqueMap(map);

     mc.cliqueMap(map);

 template <typename Param>

 template <typename Param>

 void checkMaxCliqueFullGraph(Param rule) {

 void checkMaxCliqueFullGraph(Param rule) {

   typedef FullGraph GR;

   typedef FullGraph GR;

   typedef GrossoLocatelliPullanMc<FullGraph> McAlg;

   typedef GrossoLocatelliPullanMc<FullGraph> McAlg;

   typedef McAlg::CliqueNodeIt CliqueIt;

   typedef McAlg::CliqueNodeIt CliqueIt;

   for (int size = 0; size <= 40; size = size * 3 + 1) {

   for (int size = 0; size <= 40; size = size * 3 + 1) {

     GR g(size);

     GR g(size);

     GR::NodeMap<bool> map(g);

     GR::NodeMap<bool> map(g);

     McAlg mc(g);

     McAlg mc(g);

     check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");

     check(mc.run(rule) == McAlg::SIZE_LIMIT, "Wrong termination cause");

 template <typename Param>

 template <typename Param>

 void checkMaxCliqueGridGraph(Param rule) {

 void checkMaxCliqueGridGraph(Param rule) {

   GridGraph g(5, 7);

   GridGraph g(5, 7);

   GridGraph::NodeMap<char> map(g);

   GridGraph::NodeMap<char> map(g);

   GrossoLocatelliPullanMc<GridGraph> mc(g);

   GrossoLocatelliPullanMc<GridGraph> mc(g);

   mc.iterationLimit(100);

   mc.iterationLimit(100);

   check(mc.run(rule) == mc.ITERATION_LIMIT, "Wrong termination cause");

   check(mc.run(rule) == mc.ITERATION_LIMIT, "Wrong termination cause");

   check(mc.cliqueSize() == 2, "Wrong clique size");

   check(mc.cliqueSize() == 2, "Wrong clique size");

   mc.stepLimit(100);

   mc.stepLimit(100);

   checkMaxCliqueGeneral(GrossoLocatelliPullanMc<ListGraph>::PENALTY_BASED);

   checkMaxCliqueGeneral(GrossoLocatelliPullanMc<ListGraph>::PENALTY_BASED);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::RANDOM);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::RANDOM);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::DEGREE_BASED);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::DEGREE_BASED);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::PENALTY_BASED);

   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::PENALTY_BASED);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::RANDOM);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::RANDOM);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::DEGREE_BASED);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::DEGREE_BASED);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::PENALTY_BASED);

   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::PENALTY_BASED);

   return 0;

   return 0;

 }

 }