diff --git a/ParadisEO-GPU/tutoriel/Kswap-OneMax/testKswapHC.cu b/ParadisEO-GPU/tutoriel/Kswap-OneMax/testKswapHC.cu index 4303f0bd9..1aa3c4d38 100644 --- a/ParadisEO-GPU/tutoriel/Kswap-OneMax/testKswapHC.cu +++ b/ParadisEO-GPU/tutoriel/Kswap-OneMax/testKswapHC.cu @@ -19,7 +19,7 @@ using namespace std; //To compute execution time #include // One Max ordered neighborhood -#include +#include // The Solution and neighbor comparator #include #include @@ -31,6 +31,7 @@ using namespace std; #include // The simple HC algorithm explorer #include +#include /** * @return the factorial of an unsigned integer @@ -63,7 +64,7 @@ unsigned long int sizeMapping1( unsigned int _size, unsigned int _Kswap) { // REPRESENTATION typedef moCudaBitVector solution; typedef moBitFlippingNeighbor Neighbor; -typedef moCudaKswapNeighborhood Neighborhood; +typedef moCudaKflipNeighborhood Neighborhood; void main_function(int argc, char **argv) { @@ -119,7 +120,7 @@ void main_function(int argc, char **argv) //reproducible random seed: if you don't change SEED above, // you'll aways get the same result, NOT a random run rng.reseed(seed); - + srand(time(NULL)); /* ========================================================= *