✏️ change = to + in bellman ford algorithm

aniketgargya · Apr 17, 2023 · 1a8ce6b · 1a8ce6b
1 parent ec29b36
commit 1a8ce6b
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/lecture19/code/bellman-ford-negative-cycle-detection.sudo b/src/lecture19/code/bellman-ford-negative-cycle-detection.sudo
@@ -5,7 +5,7 @@ d(s) = 0
 for k = 1 to n - 1 do
     for each v in V do
         for each edge (u, v) in In(v) do
-            d(v) = min(d(v), d(u) = l(u, v))
+            d(v) = min(d(v), d(u) + l(u, v))
 
 for each v in V do
     for each edge (u, v) in In(v) do

diff --git a/src/lecture19/code/bellman-ford.sudo b/src/lecture19/code/bellman-ford.sudo
@@ -5,7 +5,7 @@ d(s) = 0
 for k = 1 to n - 1 do
     for each v in V do
         for each edge (u, v) in In(v) do
-            d(v) = min(d(v), d(u) = l(u, v))
+            d(v) = min(d(v), d(u) + l(u, v))
 
 for each v in V do
     dist(s, v) = d(v)