Průvodce: Turn off debugging messages

diff --git a/graph.c b/graph.c
index e258af8d9bf5b23e7956a74c6da766c1a5ba2186..47b4b3dca4e2b616b91aa8ae6dcdb440848f69a6 100644 (file)
--- a/graph.c
+++ b/graph.c
@@ -264,7 +264,7 @@ static void bidir_dijkstra(struct graph_vertex *v_src, struct graph_vertex *v_de
       double best_d = 0;
       uint dir = (open[0] <= open[1]) ? 0 : 1;
       w = NULL;
-      msg(L_DEBUG, "Dijkstra: dir=%d", dir);
+      // msg(L_DEBUG, "Dijkstra: dir=%d", dir);
 
       CLIST_FOR_EACH(struct graph_vertex *, v, graph_vertices)
        {
@@ -281,7 +281,7 @@ static void bidir_dijkstra(struct graph_vertex *v_src, struct graph_vertex *v_de
       if (!w)
        die("Path not found");
 
-      msg(L_DEBUG, "Dijkstra: closing vertex #%jd (d=%f, dir %d)", w->node->o.id, best_d, dir);
+      // msg(L_DEBUG, "Dijkstra: closing vertex #%jd (d=%f, dir %d)", w->node->o.id, best_d, dir);
 
       w->state[dir] = 2;
       if (w->state[!dir] == 2)
@@ -291,7 +291,7 @@ static void bidir_dijkstra(struct graph_vertex *v_src, struct graph_vertex *v_de
        {
          struct graph_vertex *x = e->dest;
          double d = w->dist[dir] + e->length;
-         msg(L_DEBUG, "Neighbor: #%jd, state=%d, dist=%f vs. %f", x->node->o.id, x->state[dir], x->dist[dir], d);
+         // msg(L_DEBUG, "Neighbor: #%jd, state=%d, dist=%f vs. %f", x->node->o.id, x->state[dir], x->dist[dir], d);
          if (x->state[dir] == 0 || x->dist[dir] > d)
            {
              if (x->state[dir] == 2)