Skip to content

Conversation

teekaytai
Copy link

Instead of updating total_cost​ once for each edge with total_cost += pushed * cost, we can update the total_cost​ once per augmenting path with total_cost += f * d[t]​, since every path to the sink in the level graph has the same total cost.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant