Graph TheoryMediumDirected Graphs and Network Flows
Directed Graphs and Network Flows · Medium problem
A flow network has source , sink , and vertices , with capacities , , , , , , . A particular flow in this network has value . Using the smallest - cut you can find in this network, by how much could this flow's value still possibly increase?