From d703bd1ba0cbb04e721ccf291446e3769877a6f5 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sun, 27 Mar 2022 13:47:15 +0200 Subject: [PATCH] =?utf8?q?Pr=C5=AFvodce:=20Turn=20off=20debugging=20messag?= =?utf8?q?es?= MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit --- graph.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/graph.c b/graph.c index e258af8..47b4b3d 100644 --- 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) -- 2.39.5