_front_size = tmp_front_size;
} while(_front_size > 0);
-#ifdef DEBUG
+#ifdef VERBOSE
scalar_t min_delta = 0, delta;
for(int k = 0; k < _nb_edges; k++) {
Edge *e = _edges + k;
_edges[e].positivized_length = _edges[e].length;
}
- cout << "********************************************************" << endl;
- // print_dot(&cout);
-
// We use one iteration of find_shortest_path simply to propagate
// the distance to make all the edge lengths positive.
find_shortest_path(_front, _new_front);