}
}
-#ifndef TSP_DIAGNOSTICS
+#ifdef TSP_DIAGNOSTICS
printf("before reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;
p = min(i, j);
q = max(i, j);
-#ifndef TSP_DIAGNOSTICS
+#ifdef TSP_DIAGNOSTICS
printf("optimising section from %d - %d\n", p, q);
#endif
if (dir > 0)
i = q; /* resume loop from the right place */
-#ifndef TSP_DIAGNOSTICS
+#ifdef TSP_DIAGNOSTICS
printf("new section runs from %d - %d\n", p, q);
#endif
j = i;
-#ifndef TSP_DIAGNOSTICS
+#ifdef TSP_DIAGNOSTICS
printf("during reduction, circuit is");
for (k = 0; k < circuitlen; k++) {
int nc = nodes[circuit[k]];
}
}
-#ifndef TSP_DIAGNOSTICS
+#ifdef TSP_DIAGNOSTICS
printf("after reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;