algorithm,graph,max-flow,ford-fulkerson,edmonds-karp

After doing maxflow you know the amount of content each edge flowed. So, when the cost of an edge changed you can do the following things : Suppose, the content flowed by that edge is w. Now do a forward dfs and a backward dfs from that edge and undone...

Although, strictly speaking, the question could be considered as being "Off topic" (since you're mainly looking for debugging help), this is one of your first questions, so some general hints: When you post a question here, consider that people here a volunteers. Make it easy for them to answer the...

You minimum cut is not s, a, c, but s, a, b, c. Its capacity is 5 which is the maximum flow that you've calculated. You can find the minimum cut by using the definition of the residual network. Recall that the Ford-Fulkerson terminates when there are no paths between...