summaryrefslogtreecommitdiff
path: root/graph/bellmannFord.cpp
diff options
context:
space:
mode:
authormzuenni <michi.zuendorf@gmail.com>2023-01-10 11:40:09 +0100
committermzuenni <michi.zuendorf@gmail.com>2023-01-10 11:40:09 +0100
commitfd1f2b36e95c03625297b7b8cba3b1a04a0cc0ed (patch)
treeb143619750b90fbfa45a98be9ea56904d1a7129d /graph/bellmannFord.cpp
parent8faa84ca282d51e9ce4fef535e68325adabcebad (diff)
change whitespaces
Diffstat (limited to 'graph/bellmannFord.cpp')
-rw-r--r--graph/bellmannFord.cpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/graph/bellmannFord.cpp b/graph/bellmannFord.cpp
index 21c7dbe..730cad2 100644
--- a/graph/bellmannFord.cpp
+++ b/graph/bellmannFord.cpp
@@ -5,14 +5,14 @@ void bellmannFord(int n, vector<edge> edges, int start) {
for (int i = 1; i < n; i++) {
for (edge& e : edges) {
if (dist[e.from] != INF &&
- dist[e.from] + e.cost < dist[e.to]) {
+ dist[e.from] + e.cost < dist[e.to]) {
dist[e.to] = dist[e.from] + e.cost;
parent[e.to] = e.from;
}}}
for (edge& e : edges) {
if (dist[e.from] != INF &&
- dist[e.from] + e.cost < dist[e.to]) {
+ dist[e.from] + e.cost < dist[e.to]) {
// Negativer Kreis gefunden.
}}
//return dist, parent;