Minimum flows in directed s-t planar networks with arcs and nodes capacities

We present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed s-t planar networks with arcs and nodes capacities. As a final part, we present an example for these two algorithms.