Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Cycle-cancelling algorithm

Theory

Minimizing the cost

Report a typo

What is the minimum possible cost of the maximum flow?

The number near each edge are the capacity and the cost of going through each edge.

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

Enter a number
___

Create a free account to access the full topic