Question: Problem 3: Suppose that you are trying to find a max flow in a directed graph. However, instead of having capacities on the edges, you

Problem 3: Suppose that you are trying to find a max flow in a directed graph. However, instead of having capacities on the edges, you have capac- ities on the nodes. (Can you think of a real-life application for this kind of problem?) Show how to find a max flow in such a case. Hint: like we did in class, think about how to modify the graph, rather than the algorithm
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
