From c7d393b3fd9bda04d1bb190ecb076c8ca187e42e Mon Sep 17 00:00:00 2001 From: Matthew Fernandez Date: Sun, 19 Dec 2021 11:52:47 -0800 Subject: [PATCH] dijkstra.c: reflow some text --- lib/neatogen/dijkstra.c | 16 +++++----------- 1 file changed, 5 insertions(+), 11 deletions(-) diff --git a/lib/neatogen/dijkstra.c b/lib/neatogen/dijkstra.c index 37b1e7ce8..3f3ae34e7 100644 --- a/lib/neatogen/dijkstra.c +++ b/lib/neatogen/dijkstra.c @@ -159,10 +159,8 @@ void dijkstra(int vertex, vtx_data * graph, int n, DistType * dist) break; for (i = 1; i < graph[closestVertex].nedges; i++) { neighbor = graph[closestVertex].edges[i]; - increaseKey(&H, neighbor, - closestDist + - (DistType) graph[closestVertex].ewgts[i], index, - dist); + increaseKey(&H, neighbor, closestDist + + (DistType)graph[closestVertex].ewgts[i], index, dist); } prevClosestDist = closestDist; } @@ -234,10 +232,8 @@ dijkstra_bounded(int vertex, vtx_data * graph, int n, DistType * dist, break; for (i = 1; i < graph[closestVertex].nedges; i++) { neighbor = graph[closestVertex].edges[i]; - increaseKey(&H, neighbor, - closestDist + - (DistType) graph[closestVertex].ewgts[i], index, - dist); + increaseKey(&H, neighbor, closestDist + + (DistType)graph[closestVertex].ewgts[i], index, dist); } } @@ -357,8 +353,7 @@ void dijkstra_f(int vertex, vtx_data * graph, int n, float *dist) break; for (i = 1; i < graph[closestVertex].nedges; i++) { neighbor = graph[closestVertex].edges[i]; - increaseKey_f(&H, neighbor, - closestDist + graph[closestVertex].ewgts[i], + increaseKey_f(&H, neighbor, closestDist + graph[closestVertex].ewgts[i], index, dist); } } @@ -411,4 +406,3 @@ int dijkstra_sgd(graph_sgd *graph, int source, term_sgd *terms) { free(dists); return offset; } - -- 2.40.0