Merge pull request #1353 from danilopereira10/patch-2

adamant-pwn · web-flow · commit def19fc0ef64 · 2024-10-13T11:25:37.000+02:00
Clarifies statement in edmonds_karp.md
diff --git a/src/graph/edmonds_karp.md b/src/graph/edmonds_karp.md
@@ -184,7 +184,7 @@ int maxflow(int s, int t) {
 
 ## Integral flow theorem ## { #integral-theorem}
 
-The theorem simply says, that if every capacity in the network is an integer, then the flow in each edge will be an integer in the maximal flow.
+The theorem says, that if every capacity in the network is an integer, then the size of the maximum flow is an integer, and there is a maximum flow such that the flow in each edge is an integer as well. In particular, Ford-Fulkerson method finds such a flow.
 
 ## Max-flow min-cut theorem
 
