Compute the max flow for the following diagram, using the Ford-Fulkerson algorithm.
I computed the max flow, using the Ford-Fulkerson algorithm, and I got 14. However, the capacity of the min cut I found is 16, which does not verify the max-flow/min-cut theorem. Otherwise, if I did something wrong in finding the min-cut and/or max flow, let me know. It took me so much hours to work out this problem.