Now it is the right MaxFlow. I missed the point in the exercise that it is an undirected graph (every edge(u,v) brings an edge(v,u) with it). Still not done: "bottleneck" as list of arcs