Network Flow

2. In Lesson 4, we learned network flow. In the problem, capacities on a graph are given constants (which are the algorithm's input, along with the graph itself Now, suppose that we are interested in two edges e and e2 are nonnegative and satisfying c1+o2K where K is a given positive number (so the K is part of the algorithm's input). Under this setting, can you think of an effcicient algorithm to solve network flow problem? This is a difficult problem 2. In Lesson 4, we learned network flow. In the problem, capacities on a graph are given constants (which are the algorithm's input, along with the graph itself Now, suppose that we are interested in two edges e and e2 are nonnegative and satisfying c1+o2K where K is a given positive number (so the K is part of the algorithm's input). Under this setting, can you think of an effcicient algorithm to solve network flow problem? This is a difficult