This Wikipedia example is very confusing. Its saying the max flow = min cut. But I see the max flow = 9 and the min cut = 7. If not, how does the capacity =min cut here? Which is the max flow min cut theorem. 
Can not follow the example for max-flow-min-cut on Wikipedia
algorithms;graphs;network flow
Okay, really sorry. I got confused with maximal and max flow in the graph. Obviously, the maximal is what is at most the capacity, and max flow is how much at most can flow though this network. The answer to the former is of course 9, where at the latter is 7. In this case the max flow from s to t through 1 is 4 and from s to t through 2 (as first node) is 3 which equals the min cut, which is the dashed arrow. I hope this helps anyone who had the same confusion. 