X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/ffea735548f5d4940dae32d8071a2676f6716ad0..97a4b4dbf628a627e3c2d5689be89265f56074df:/loba_fairstrategy.cpp?ds=inline

diff --git a/loba_fairstrategy.cpp b/loba_fairstrategy.cpp
index 81de9e1..eb05b49 100644
--- a/loba_fairstrategy.cpp
+++ b/loba_fairstrategy.cpp
@@ -1,9 +1,10 @@
-#include "loba_fairstrategy.h"
 #include <algorithm>
 #include <xbt/log.h>
 
 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(loba);
 
+#include "loba_fairstrategy.h"
+
 /* simple version:
  *   load balance with a least-loaded neighbor,
  *   without breaking the ping-pong condition
@@ -25,12 +26,7 @@ double loba_fairstrategy::load_balance(double my_load)
 
 		std::sort(pneigh.begin(),pneigh.end(),compare());
 
-		//print_loads();
-
-		INFO0("list voisins");
-		for(unsigned i=0;i< pneigh.size() ; ++i) {
-			INFO2("%s %f ", pneigh[i]->get_name(), pneigh[i]->get_load());
-		}
+		print_loads_p();
 
 		double sum_sent=0;
 		bool found=true;