Let G be the digraph given in Figure 10.2 with capacity constraints b and c. We require a feasible circulation on G. By Theorem 10.2.1, we have to determine a maximal flow for the network N shown in Figure 10.3. In general, we would use one of the algorithms of Chapter 6 for such a task; for this simple example, the desired maximal flow can be found by inspection.
