polishing up mlp version of benchmark

[IRC.git] / Robust / src / Benchmarks / mlp / directto / mlp-java / Algorithm.java

diff --git a/Robust/src/Benchmarks/mlp/directto/mlp-java/Algorithm.java b/Robust/src/Benchmarks/mlp/directto/mlp-java/Algorithm.java
index e8682b077ca730b6ffd7d058d01ae11d310412e8..a969ad76040dff18be232daac9df05da33ef886e 100755 (executable)
--- a/Robust/src/Benchmarks/mlp/directto/mlp-java/Algorithm.java
+++ b/Robust/src/Benchmarks/mlp/directto/mlp-java/Algorithm.java
@@ -44,7 +44,7 @@ public class Algorithm {
        Point4d point1=(Point4d) p1.elementAt(pos);
        Point4d point2=(Point4d) p2.elementAt(pos);
        if (isConflict(point1,point2)) {              
-         //System.out.println(point1+" "+point2);
+         System.out.println(point1+" "+point2);
          found=true;
          conflictPoint=point1;
        }
@@ -81,8 +81,8 @@ public class Algorithm {
   public /*static*/ void doIteration() {
     time=initialTime+currIteration*d2.getStatic().iterationStep();
     currIteration++;
-    //System.out.println("In doIteration!");
-    //System.out.println("Time:"+time);
+    System.out.println("In doIteration!");
+    System.out.println("Time:"+time);
     
     cList.clear();
     
@@ -95,7 +95,7 @@ public class Algorithm {
       d2.getTrajectorySynthesizer().updateTrajectory(time,aAux);
     }
     
-    //System.out.println("Does it get here? (after the trajectory update)");
+    System.out.println("Does it get here? (after the trajectory update)");
 
     for (i=0;i<n;i++)
       for (j=i+1;j<n;j++) {