Course: Graph Theory

2. Find a maximal flow for the graph in Figure 1 such that f(x,y) Z for all x, y. 1 5 CT 2 1 4 4 N OT 5 4 3 3 4 Figure 1: graph for problem #2. Capacity values shown in blue 2. Find a maximal flow for the graph in Figure 1 such that f(x,y) Z for all x, y. 1 5 CT 2 1 4 4 N OT 5 4 3 3 4 Figure 1: graph for problem #2. Capacity values shown in blue