the maximum flow problem Given is G = (V, E), a weighted directed graph with o a single source sE V, a single sink t E V, and o capacities ce for each e E The maximum flow problem asks for an s-t flow f with the largest value v(f) over all possible s-t flows. As we solve the maximum flow problem, we will identify the edge that has the capacity which bounds the maximum flow. Computer Algorithms 1 (CS 401/MCS 401) L-15 23 July 2018 6/46 uniqueness of the maximum flow problem Exercise 1 Is the solution to the maximum flow problem unique? Justify your anwers with examples. Formulate conditions on the input data for a solution to be or not to be unique. the maximum flow problem Given is G = (V, E), a weighted directed graph with o a single source sE V, a single sink t E V, and o capacities ce for each e E The maximum flow problem asks for an s-t flow f with the largest value v(f) over all possible s-t flows. As we solve the maximum flow problem, we will identify the edge that has the capacity which bounds the maximum flow. Computer Algorithms 1 (CS 401/MCS 401) L-15 23 July 2018 6/46 uniqueness of the maximum flow problem Exercise 1 Is the solution to the maximum flow problem unique? Justify your anwers with examples. Formulate conditions on the input data for a solution to be or not to be unique