Recall that the Edmonds-Karp algorithm refines the idea ofFord-Fulkerson in the following way: in every iteration, thealgorithm chooses the augmenting path that uses the fewest edges(if there are multiple such paths, it chooses one arbitrarily).Find a graph for which in some iteration the Edmonds-Karp algorithmhas to choose a path that uses a backward edge. Run the algorithm(by hand) on your graph – more precisely, for every iteration drawthe residual graph and show the augmenting path taken by thealgorithm as well as the flow after adding the augmenting path.
Solution