git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2321 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
fff88e3986
commit
8a50c58ed1
4 changed files with 0 additions and 484 deletions
|
|
@ -1,147 +0,0 @@
|
||||||
/*
|
|
||||||
<t-moBitFlippingNeighbor.cpp>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
Karima Boufaras, Thé Van LUONG
|
|
||||||
|
|
||||||
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
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <cstdlib>
|
|
||||||
#include <cassert>
|
|
||||||
#include <iostream>
|
|
||||||
#include <neighborhood/moBitFlippingNeighbor.h>
|
|
||||||
#include <eo>
|
|
||||||
#include <ga/eoBit.h>
|
|
||||||
|
|
||||||
//typedef moCudaIntVector<eoMaximizingFitness> Solution;
|
|
||||||
typedef eoBit<eoMaximizingFitness> Solution;
|
|
||||||
typedef moBitFlippingNeighbor<Solution> Neighbor;
|
|
||||||
|
|
||||||
int main() {
|
|
||||||
|
|
||||||
std::cout << "[t-moBitFlippingNeighbor] => START" << std::endl;
|
|
||||||
|
|
||||||
Solution sol(5, 0);
|
|
||||||
for (int i = 0; i < 5; i++) {
|
|
||||||
sol[i] = (i % 2 == 0) ? 0 : 1;
|
|
||||||
std::cout << " " << sol[i] << std::endl;
|
|
||||||
}
|
|
||||||
|
|
||||||
assert(sol[0] == 0);
|
|
||||||
assert(sol[1] == 1);
|
|
||||||
assert(sol[2] == 0);
|
|
||||||
assert(sol[3] == 1);
|
|
||||||
assert(sol[4] == 0);
|
|
||||||
|
|
||||||
//test constructor
|
|
||||||
Neighbor neighbor;
|
|
||||||
assert(neighbor.index() == 0);
|
|
||||||
assert(neighbor.getKswap() == 0);
|
|
||||||
|
|
||||||
//test setter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
neighbor.setIndice(i, i);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
assert(neighbor.getIndice(i) == i);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor.move(sol);
|
|
||||||
assert(sol[neighbor.getIndice(0)] == 1);
|
|
||||||
|
|
||||||
//test moveBack
|
|
||||||
neighbor.moveBack(sol);
|
|
||||||
assert(sol[neighbor.getIndice(0)] == 0);
|
|
||||||
|
|
||||||
Neighbor neighbor1(1);
|
|
||||||
//test setter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor1.getKswap(); i++)
|
|
||||||
neighbor1.setIndice(i, i);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor1.getKswap(); i++)
|
|
||||||
assert(neighbor1.getIndice(i) == i);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor1.move(sol);
|
|
||||||
assert(sol[neighbor1.getIndice(0)] == 1);
|
|
||||||
assert(sol[neighbor1.getIndice(1)] == 0);
|
|
||||||
|
|
||||||
//test moveBack
|
|
||||||
neighbor1.moveBack(sol);
|
|
||||||
assert(sol[neighbor1.getIndice(0)] == 0);
|
|
||||||
assert(sol[neighbor1.getIndice(1)] == 1);
|
|
||||||
|
|
||||||
//test set & get indice
|
|
||||||
neighbor1.setIndice(0, 1);
|
|
||||||
neighbor1.setIndice(1, 2);
|
|
||||||
assert(neighbor1.getIndice(0) == 1);
|
|
||||||
assert(neighbor1.getIndice(1) == 2);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor1.move(sol);
|
|
||||||
|
|
||||||
assert(sol[neighbor1.getIndice(0)] == 0);
|
|
||||||
assert(sol[neighbor1.getIndice(1)] == 1);
|
|
||||||
|
|
||||||
//test move back
|
|
||||||
neighbor1.moveBack(sol);
|
|
||||||
assert(sol[neighbor1.getIndice(0)] == 1);
|
|
||||||
assert(sol[neighbor1.getIndice(1)] == 0);
|
|
||||||
|
|
||||||
Neighbor neighbor2(2);
|
|
||||||
|
|
||||||
//test setter of one index
|
|
||||||
neighbor2.setIndice(0, 2);
|
|
||||||
neighbor2.setIndice(1, 3);
|
|
||||||
neighbor2.setIndice(2, 4);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
assert(neighbor2.getIndice(0) == 2);
|
|
||||||
assert(neighbor2.getIndice(1) == 3);
|
|
||||||
assert(neighbor2.getIndice(2) == 4);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor2.move(sol);
|
|
||||||
assert(sol[neighbor2.getIndice(0)] == 1);
|
|
||||||
assert(sol[neighbor2.getIndice(1)] == 0);
|
|
||||||
assert(sol[neighbor2.getIndice(2)] == 1);
|
|
||||||
|
|
||||||
//test moveBack
|
|
||||||
neighbor2.moveBack(sol);
|
|
||||||
assert(sol[neighbor2.getIndice(0)] == 0);
|
|
||||||
assert(sol[neighbor2.getIndice(1)] == 1);
|
|
||||||
assert(sol[neighbor2.getIndice(2)] == 0);
|
|
||||||
|
|
||||||
std::cout << "[t-moBitFlippingNeighbor] => OK" << std::endl;
|
|
||||||
|
|
||||||
return EXIT_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
@ -1,93 +0,0 @@
|
||||||
/*
|
|
||||||
<t-moIndexSwapNeighbor.h>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
Boufaras Karima, Thé Van Luong
|
|
||||||
|
|
||||||
This software is governed by the CeCILL license under French law and
|
|
||||||
abiding by the rules of distribution of free software. You can ue,
|
|
||||||
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".
|
|
||||||
|
|
||||||
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
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <cstdlib>
|
|
||||||
#include <cassert>
|
|
||||||
#include <iostream>
|
|
||||||
#include <neighborhood/moIndexSwapNeighbor.h>
|
|
||||||
#include <eo>
|
|
||||||
#include <eoInt.h>
|
|
||||||
|
|
||||||
typedef eoInt<eoMaximizingFitness> Solution;
|
|
||||||
typedef moIndexSwapNeighbor<Solution> Neighbor;
|
|
||||||
|
|
||||||
int main() {
|
|
||||||
|
|
||||||
std::cout << "[t-moIndexswapNeighbor] => START" << std::endl;
|
|
||||||
|
|
||||||
//test default constructor
|
|
||||||
Neighbor neighbor0;
|
|
||||||
assert(neighbor0.index() == 0);
|
|
||||||
assert(neighbor0.getKswap() == 0);
|
|
||||||
|
|
||||||
//test constructor
|
|
||||||
Neighbor neighbor(1);
|
|
||||||
assert(neighbor.index() == 0);
|
|
||||||
assert(neighbor.getKswap() == 1);
|
|
||||||
|
|
||||||
//test setter & getter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
neighbor.setIndice(i, i);
|
|
||||||
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
assert(neighbor.getIndice(i) == i);
|
|
||||||
|
|
||||||
//test copy Constructor
|
|
||||||
Neighbor neighbor1(neighbor);
|
|
||||||
assert(neighbor1.index() == 0);
|
|
||||||
assert(neighbor1.getKswap() == 1);
|
|
||||||
for (unsigned int i = 0; i <= neighbor1.getKswap(); i++)
|
|
||||||
assert(neighbor1.getIndice(i) ==i);
|
|
||||||
|
|
||||||
//test assignement operator
|
|
||||||
|
|
||||||
for (unsigned int i = 0; i <= neighbor1.getKswap(); i++)
|
|
||||||
neighbor1.setIndice(i, 0);
|
|
||||||
|
|
||||||
//test setter and getter of set of indexes
|
|
||||||
neighbor1.setIndices(neighbor.getIndices());
|
|
||||||
for (unsigned int i = 0; i <= neighbor1.getKswap(); i++)
|
|
||||||
assert(neighbor1.getIndice(i) ==i);
|
|
||||||
|
|
||||||
Neighbor neighbor2(2);
|
|
||||||
|
|
||||||
//test setter of one index
|
|
||||||
neighbor2.setIndice(0, 0);
|
|
||||||
neighbor2.setIndice(1, 1);
|
|
||||||
neighbor2.setIndice(2, 2);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
assert(neighbor2.getIndice(0) == 0);
|
|
||||||
assert(neighbor2.getIndice(1) == 1);
|
|
||||||
assert(neighbor2.getIndice(2) == 2);
|
|
||||||
|
|
||||||
std::cout << "[t-moKswapNeighbor] => OK" << std::endl;
|
|
||||||
|
|
||||||
return EXIT_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
@ -1,122 +0,0 @@
|
||||||
/*
|
|
||||||
<t-moKswapNeighbor.cpp>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
Karima Boufaras, Thé Van LUONG
|
|
||||||
|
|
||||||
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
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <cstdlib>
|
|
||||||
#include <cassert>
|
|
||||||
#include <iostream>
|
|
||||||
#include <eoInt.h>
|
|
||||||
#include <neighborhood/moKswapNeighbor.h>
|
|
||||||
#include <eo>
|
|
||||||
|
|
||||||
//typedef moCudaIntVector<eoMaximizingFitness> Solution;
|
|
||||||
typedef eoInt<eoMaximizingFitness> Solution;
|
|
||||||
typedef moKswapNeighbor<Solution> Neighbor;
|
|
||||||
|
|
||||||
int main() {
|
|
||||||
|
|
||||||
std::cout << "[t-moKswapNeighbor] => START" << std::endl;
|
|
||||||
|
|
||||||
Solution sol1(5);
|
|
||||||
for (int i = 0; i < 5; i++) {
|
|
||||||
sol1[i] = 4 - i;
|
|
||||||
}
|
|
||||||
|
|
||||||
//test constructor
|
|
||||||
Neighbor neighbor(1);
|
|
||||||
assert(neighbor.index() == 0);
|
|
||||||
assert(neighbor.getKswap() == 1);
|
|
||||||
|
|
||||||
//test setter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
neighbor.setIndice(i, i);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
for (unsigned int i = 0; i <= neighbor.getKswap(); i++)
|
|
||||||
assert(neighbor.getIndice(i) == i);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor.move(sol1);
|
|
||||||
assert(sol1[neighbor.getIndice(0)] == 3);
|
|
||||||
assert(sol1[neighbor.getIndice(1)] == 4);
|
|
||||||
|
|
||||||
//test moveBack
|
|
||||||
neighbor.moveBack(sol1);
|
|
||||||
assert(sol1[neighbor.getIndice(0)] == 4);
|
|
||||||
assert(sol1[neighbor.getIndice(1)] == 3);
|
|
||||||
|
|
||||||
//test set & get indice
|
|
||||||
neighbor.setIndice(0, 1);
|
|
||||||
neighbor.setIndice(1, 2);
|
|
||||||
assert(neighbor.getIndice(0) == 1);
|
|
||||||
assert(neighbor.getIndice(1) == 2);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor.move(sol1);
|
|
||||||
assert(sol1[neighbor.getIndice(0)] == 2);
|
|
||||||
assert(sol1[neighbor.getIndice(1)] == 3);
|
|
||||||
|
|
||||||
//test move back
|
|
||||||
neighbor.moveBack(sol1);
|
|
||||||
assert(sol1[neighbor.getIndice(0)] == 3);
|
|
||||||
assert(sol1[neighbor.getIndice(1)] == 2);
|
|
||||||
|
|
||||||
Neighbor neighbor2(2);
|
|
||||||
|
|
||||||
//test setter of one index
|
|
||||||
neighbor2.setIndice(0, 0);
|
|
||||||
neighbor2.setIndice(1, 1);
|
|
||||||
neighbor2.setIndice(2, 2);
|
|
||||||
|
|
||||||
//test getter of one index
|
|
||||||
assert(neighbor2.getIndice(0) == 0);
|
|
||||||
assert(neighbor2.getIndice(1) == 1);
|
|
||||||
assert(neighbor2.getIndice(2) == 2);
|
|
||||||
|
|
||||||
//test move
|
|
||||||
neighbor2.move(sol1);
|
|
||||||
assert(sol1[neighbor2.getIndice(0)] == 3);
|
|
||||||
assert(sol1[neighbor2.getIndice(1)] == 2);
|
|
||||||
assert(sol1[neighbor2.getIndice(2)] == 4);
|
|
||||||
|
|
||||||
//test moveBack
|
|
||||||
neighbor2.moveBack(sol1);
|
|
||||||
assert(sol1[neighbor2.getIndice(0)] == 4);
|
|
||||||
assert(sol1[neighbor2.getIndice(1)] == 3);
|
|
||||||
assert(sol1[neighbor2.getIndice(2)] == 2);
|
|
||||||
|
|
||||||
std::cout << "[t-moKswapNeighbor] => OK" << std::endl;
|
|
||||||
|
|
||||||
return EXIT_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
@ -1,122 +0,0 @@
|
||||||
/*
|
|
||||||
<t-moKswapNeighborhood.cu>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
Karima Boufaras, Thé Van LUONG
|
|
||||||
|
|
||||||
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
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <cstdlib>
|
|
||||||
#include <cassert>
|
|
||||||
#include <iostream>
|
|
||||||
#include <eoInt.h>
|
|
||||||
#include <neighborhood/moKswapNeighbor.h>
|
|
||||||
#include <neighborhood/moKswapNeighborhood.h>
|
|
||||||
#include <eo>
|
|
||||||
|
|
||||||
typedef eoInt<eoMaximizingFitness> Solution;
|
|
||||||
typedef moKswapNeighbor<Solution> Neighbor;
|
|
||||||
typedef moKswapNeighborhood<Neighbor> Neighborhood;
|
|
||||||
|
|
||||||
int main() {
|
|
||||||
|
|
||||||
std::cout << "[t-moKswapNeighborhood] => START" << std::endl;
|
|
||||||
|
|
||||||
//test factorial
|
|
||||||
assert(factorial(10) == 3628800);
|
|
||||||
|
|
||||||
//test sizeMapping
|
|
||||||
assert(sizeMapping(6, 1) == 15);
|
|
||||||
assert(sizeMapping(6, 2) == 20);
|
|
||||||
assert(sizeMapping(6, 3) == 15);
|
|
||||||
assert(sizeMapping(6, 4) == 6);
|
|
||||||
|
|
||||||
Solution sol(6);
|
|
||||||
Neighbor neighbor(1);
|
|
||||||
|
|
||||||
unsigned int * first;
|
|
||||||
unsigned int * second;
|
|
||||||
unsigned int * indices;
|
|
||||||
|
|
||||||
indices = new unsigned int[2];
|
|
||||||
first = new unsigned int[15];
|
|
||||||
second = new unsigned int[15];
|
|
||||||
unsigned int id = 0;
|
|
||||||
for (unsigned int i = 0; i < 5; i++)
|
|
||||||
for (unsigned int j = i + 1; j < 6; j++) {
|
|
||||||
first[id] = i;
|
|
||||||
second[id] = j;
|
|
||||||
id++;
|
|
||||||
}
|
|
||||||
|
|
||||||
//test Constructor
|
|
||||||
Neighborhood neighborhood(6, 1);
|
|
||||||
assert(neighborhood.getSize() == 6);
|
|
||||||
assert(neighborhood.getKswap() == 1);
|
|
||||||
assert(neighborhood.position() == 0);
|
|
||||||
assert(neighborhood.getNeighborhoodSize() == 15);
|
|
||||||
|
|
||||||
//test neighborhood methods
|
|
||||||
|
|
||||||
//test hasNeighbor
|
|
||||||
assert(neighborhood.hasNeighbor(sol) == true);
|
|
||||||
|
|
||||||
//test init
|
|
||||||
neighborhood.init(sol, neighbor);
|
|
||||||
assert(neighbor.index() == 0);
|
|
||||||
assert(neighbor.getSize() == 6);
|
|
||||||
assert(neighbor.getKswap() == 1);
|
|
||||||
assert(neighborhood.position() == 0);
|
|
||||||
|
|
||||||
//test Mapping
|
|
||||||
indices[0] = first[neighborhood.position()];
|
|
||||||
indices[1] = second[neighborhood.position()];
|
|
||||||
assert(neighbor.getIndice(0) == indices[0]);
|
|
||||||
assert(neighbor.getIndice(1) == indices[1]);
|
|
||||||
|
|
||||||
//test next & cont
|
|
||||||
for (int i = 1; i < 15; i++)
|
|
||||||
if (neighborhood.cont(sol)) {
|
|
||||||
neighborhood.next(sol, neighbor);
|
|
||||||
assert(neighborhood.position() == i);
|
|
||||||
//test Mapping
|
|
||||||
indices[0] = first[neighborhood.position()];
|
|
||||||
indices[1] = second[neighborhood.position()];
|
|
||||||
assert(neighbor.getIndice(0) == indices[0]);
|
|
||||||
assert(neighbor.getIndice(1) == indices[1]);
|
|
||||||
}
|
|
||||||
|
|
||||||
delete[] (indices);
|
|
||||||
delete[] (first);
|
|
||||||
delete[] (second);
|
|
||||||
std::cout << "[t-moKswapNeighborhood] => OK" << std::endl;
|
|
||||||
|
|
||||||
return EXIT_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue