Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsMaximum flow algorithms

Maximum flow problem

Theory

Reversed problem

Report a typo

Below is a graph with capacities written near each edge. You know that the maximum flow is 17. What is the minimal possible capacity of the edge DE?

Reversed problem

Enter a number

Create a free account to access the full topic