**Article:** [Maximum flow - Ford-Fulkerson and Edmonds-Karp](https://cp-algorithms.com/graph/edmonds_karp.html) **Problem:** <!-- The article says "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." Two problems there. 1) "maximal" should be "maximum". 2) The theorem says that there exists a maximum flow with an integer flow in each edge. It is not possible to ensure that in every network with ingeteger capacities, every maximum flow has an integer flow in every edge. So the correct statement would be "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 is an integer." It can be added that FF will find such a maximum flow. -->