Update notes/brain_teasers.md

djeada · Copilot · web-flow · commit dc23e855b0fc · 2025-08-31T23:25:29.000+02:00
Co-authored-by: Copilot &lt;175728472+Copilot@users.noreply.github.com&gt;
diff --git a/notes/brain_teasers.md b/notes/brain_teasers.md
@@ -154,7 +154,7 @@ V. *Minimum Spanning Trees (MST)*:
 
 VI. *Network Flow Algorithms*:
 
-* In capacity networks, iterating augmenting paths with the *Ford–Fulkerson method* increases flow until none remain, whereas treating edges independently leaves throughput unused; for example, pushing more water through a pipe system.
+* In capacity networks, iterating augmenting paths with the *Ford-Fulkerson method* increases flow until none remain, whereas treating edges independently leaves throughput unused; for example, pushing more water through a pipe system.
 * To control search effort, adopting *Edmonds–Karp* chooses shortest augmenting paths by BFS, whereas arbitrary choices may require many iterations; for example, allocating bandwidth across shared links.
 
 VII. *Other Important Concepts*:
