Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Cycle-cancelling algorithm

Theory

Putting into order

Report a typo

Put the steps of the cycle-cancelling algorithm into correct order.

Put the items in the correct order
Create a graph G by assigning a cost to each edge, which residual capacity is positive
Find any maximum flow in a network
Get rid of all negative cycles
Find a negative cycle in a graph G
___

Create a free account to access the full topic