Negative cycle-canceling: Difference between revisions
Jump to navigation
Jump to search
| Line 27: | Line 27: | ||
# Run an [[All pairs shortest paths|all-pairs shortest-paths]] algorithm. | # Run an [[All pairs shortest paths|all-pairs shortest-paths]] algorithm. | ||
# If the distance <math>v\rightarrow v</math> is 0 for all <math>v\in V</math>, the break condition applies. | # If the distance <math>v\rightarrow v</math> is 0 for all <math>v\in V</math>, the break condition applies. | ||
# Otherwise (that is, the distance is negative) | # Otherwise (that is, the distance is negative): | ||
Revision as of 12:03, 22 October 2014
Abstract view
Algorithmic problem: Min-cost flow problem
Type of algorithm: loop
Invariant: The flow is feasible.
Variant: The cost of the flow decreases.
Definition: A cycle is negative if the sum of the cost values on all of its arcs is negative.
Break condition: There is no more negative cycle in the residual network.
Induction basis
Abstract view: Start with an arbitrary feasible flow, for example, the zero flow.
Induction step
Abstract view:
- Find a cycle of negative cost in the residual network.
- Augment the flow on all arcs of this cycle by the minmum residual capacity of all arcs on this cycle.
Implementation:
- Run an all-pairs shortest-paths algorithm.
- If the distance [math]\displaystyle{ v\rightarrow v }[/math] is 0 for all [math]\displaystyle{ v\in V }[/math], the break condition applies.
- Otherwise (that is, the distance is negative):