Professional Documents
Culture Documents
Maximal Flow Problem
Maximal Flow Problem
network would allow to flow from the source node to its sink node.
Minimum Cut in a Graph
In general, a cut is a set of edges whose removal divides a connected graph into
two disjoint subsets. There are two variations of a cut: maximum cut and
minimum cut. Before discussing the max-flow min-cut theorem, it’s important to
understand what a minimum cut is.
The minimum cut of a weighted graph is defined as the minimum sum of
weights of edges that, when removed from the graph, divide the graph into
two sets.
Example: What is the max-flow of this network from the source a to sink f ?
In this graphic, each edge represents the amount of water, in gallons, that can pass
through it at any given time.