Cosmetics.

[mtp.git] / mtp_graph.cc

diff --git a/mtp_graph.cc b/mtp_graph.cc
index cc816c9..590bdb2 100644 (file)
--- a/mtp_graph.cc
+++ b/mtp_graph.cc
@@ -289,7 +289,7 @@ void MTPGraph::find_shortest_path(Vertex **_front, Vertex **_new_front) {
     _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;
@@ -314,9 +314,6 @@ void MTPGraph::find_best_paths(scalar_t *lengths) {
     _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);