Update edmonds_karp.md

adamant-pwn · web-flow · commit 43f5a70d617f · 2024-10-13T11:24:36.000+02:00
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 there exists a maximum flow such that the flow in each edge may be an integer. Ford-Fulkerson method can be used to find such a 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
 
