Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Cycle-cancelling algorithm

Theory

Looking for cycles

Report a typo

You have the following network:

A network, containing information about the flow, capacity and cost of each edge

The numbers near each edge are flow, capacity and cost of going through it respectively.

Which of the following cycles will you find in a graph of costs as negative on the first iteration of the Cycle-cancelling algorithm?

Select one or more options from the list
___

Create a free account to access the full topic