graph theory
Consider a flow network (G, f, c, s, t) with the following specifications:
• V (G) := {(x, y) : x, y ∈ [−10, 10] ∩ Z}
• arcs between every two vertices with (Euclidean) distance exactly one
• c(e) := max{0, y^2 ± x}, where x and y signify the values of x and y at the end of the arc and ± resolves to + for an arc beginning at x and − for one beginning at y
• s is the origin
• t is (1, 1)
Draw a picture showing the flow you obtain after applying the augmenting path algorithm, as well as the corresponding cut.
