a. consider a flow network in which vertices, as well as edges, have capacities. that is, the total positive flow entering any given vertex is subject to a capacity constraint. show that determining the maximum flow in a network with edge and vertex capacities can be reduced to an ordinary maximum-flow problem on a flow network of comparable size. b. describe an efficient algorithm to solve the escape problem and analyze its running time.
