--- a/docs/algorithm-ford-fulkerson.pseudocode	Wed May 06 01:31:41 2026 +0200
+++ b/docs/algorithm-ford-fulkerson.pseudocode	Wed May 06 10:05:57 2026 +0200
@@ -3,7 +3,7 @@
   \INPUTS{Given a network \expr{G = (V, E)} with flow capacity \expr{c}, a source node \expr{s}, and a sink node \expr{t}}
   \OUTPUT{Compute a flow \expr{f} from \expr{s} to \expr{t} of maximum value}
 \IS
-  \TEXT{1. \expr{f(u, v) <- 0} for all edges \expr{(u, v)}
+  \TEXT{1. \expr{f(u, v) \gets 0} for all edges \expr{(u, v)}
 
   2. While there is a path \expr{p} from \expr{s} to \expr{t} in \expr{G_f},
      such that \expr{c_f(u, v) > 0} for all edges \expr{(u, v) ∈ p}:
@@ -12,8 +12,8 @@
 
      2. For each edge \expr{(u, v) ∈ p}
 
-        1. \expr{f(u, v) <- f(u, v) + c_f(p)}   \rem Send flow along the path
+        1. \expr{f(u, v) \gets f(u, v) + c_f(p)}   \rem Send flow along the path
 
-	2. \expr{f(v, u) <- f(v, u) - c_f(p)}   \rem The flow might be "returned" later
+	2. \expr{f(v, u) \gets f(v, u) - c_f(p)}   \rem The flow might be "returned" later
 }
 \END ALGORITHM {Ford–Fulkerson}