nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Nettoyage des tutos ce coup ci c'est bon :)

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1815 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2010-05-17 15:20:12 +00:00
commit 961dcba259
21 changed files with 2697 additions and 2697 deletions
Download patch file Download diff file Expand all files Collapse all files

16
trunk/paradiseo-mo/tutorial/Lesson7/hybridAlgo.cpp
View file

@ -133,10 +133,10 @@ void main_function(int argc, char **argv)
Queen tmp;
for(unsigned int i=0; i<20; i++){
init(tmp);
fullEval(tmp);
pop.push_back(tmp);
for (unsigned int i=0; i<20; i++) {
init(tmp);
fullEval(tmp);
pop.push_back(tmp);
}
/* =========================================================
@ -193,16 +193,16 @@ void main_function(int argc, char **argv)
std::cout << "INITIAL POPULATION:" << std::endl;
std::cout << "-------------------" << std::endl;
for(unsigned int i=0; i<pop.size(); i++)
std::cout << pop[i] << std::endl;
for (unsigned int i=0; i<pop.size(); i++)
std::cout << pop[i] << std::endl;
hybridAlgo(pop);
std::cout << std::endl;
std::cout << "FINAL POPULATION:" << std::endl;
std::cout << "-------------------" << std::endl;
for(unsigned int i=0; i<pop.size(); i++)
std::cout << pop[i] << std::endl;
for (unsigned int i=0; i<pop.size(); i++)
std::cout << pop[i] << std::endl;
}