Maximum (Max) Flow is one of the problems in the family of problems involving flow in networks.
In Max Flow problem, we aim to find the maximum flow from a particular source vertex s to a particular sink vertex t in a directed weighted graph G.
There are several algorithms for finding the maximum flow including Ford-Fulkerson method, Edmonds-Karp algorithm, and Dinic's algorithm (there are others, but not included in this visualization yet).
The dual problem of Max Flow is Min Cut, i.e., by finding the max s-t flow of G, we also simultaneously find the min s-t cut of G, i.e., the set of edges with minimum weight that have to be removed from G so that there is no path from s to t in G.
Max-Flow (or Min-Cut) problems arise in various applications, e.g.,
This visualization page will show the execution of a chosen Max Flow algorithm running on a flow (residual) graph.
To make the visualization of these flow graphs consistent, we enforce a graph drawing rule for this page whereby the source vertex s/sink vertex t is always vertex 0/V-1 and is always drawn on the leftmost/rightmost side of the visualization, respectively. Another visualization-specific constraint is that the edge capacities are integers between [1..99].
These visualization-specific constraints are not exist in the standard max flow problems.
The input for a Max Flow algorithm is a flow graph (a directed weighted graph G = (V, E) where edge weight represent the capacity (the unit is problem-dependent, e.g., liters/second, person/hour, etc) of flow that can go through that edge) with two distinguished vertices: The source vertex s and the sink/target/destination vertex t.
In this visualization, these two additional inputs of s (usually vertex 0) and t (usually vertex V-1) are asked before the execution of the chosen Max Flow algorithm and can be customized by the user.
The output for a Max Flow algorithm is an assignment of flow f to each edge that satisfies two important constraints:
In this visualization, we focus on showing the final max flow value and the final ST-min cut components at the end of each max flow algorithm execution, instead of the precise assignment of flow f to each edge, i.e., f(e) must be computed manually from the initial capacity c(e) (first frame of the animation) minus the final residual capacity of that edge e (last frame of the animation).
At the start of the three Max Flow algorithms discussed in this visualization (Ford-Fulkerson method, Edmonds-Karp algorithm, and Dinic's algorithm), the initial flow graph is converted into residual graph (with potential addition of back flow edges with initial capacity of zeroes).
The edges in the residual graph store the remaining capacities of those edges that can be used by future flow(s). At the beginning, these remaining capacities equal to the original capacities as specified in the input flow graph.
A Max Flow algorithm will send flows to use some (or all) of these available capacities, iteratively.
Once the remaining capacity of an edge reaches 0, that edge can no longer admit any more flow.
There are three different sources for specifying an input flow graph:
There are three different max flow algorithms in this visualization:
For the three Max Flow algorithms discussed in this visualization, successive flows are sent from the source vertex s to the sink vertex t via available augmenting paths (augmenting path is a path from s to t that goes through edges with positive weight residual capacity (c(e)-f(e)) left).
The three Max Flow algorithms in this visualization have different behavior on how they find augmenting paths.
However, all three Max Flow algorithms in this visualization stop when there is no more augmenting path possible and report the max flow value (and the assignment of flow on each edge in the flow graph).
Later we will discuss that this max flow value is also the min cut value of the flow graph (that famous Max-Flow/Min-Cut Theorem).
start with 0 flow
while there exists an augmenting path: // iterative algorithm
find an augmenting path (for now, 'any' graph traversal will do)
compute bottleneck capacity
increase flow on the path by the bottleneck capacity
This famous theorem states that in a flow network, the maximum flow from s to t is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges that have to be removed to disconnect s from t.
In a typical Computer Science classes, the lecturer will usually spend some time to properly explain this theorem (explaining what is an st-cut, capacity of an st-cut, net flow across an st-cut equals to current flow f assignment that will never exceed the capacity of the cut, and finally that Max-Flow/Min-Cut Theorem). For this visualization, we just take this statement as it is.
Using the Max-Flow/Min-Cut Theorem, we can then prove that flow f is a maximum flow if and only if there is no (more) augmenting path remaining in the residual graph.
As this is what Ford-Fulkerson Method is doing, we can conclude the correctness of this Ford-Fulkerson Method, i.e., if Ford-Fulkerson Method terminates, then there is no augmenting path left and thus the resulting flow is maximum.
Ford-Fulkerson method always terminates if the capacities are integers.
This is because every iteration of Ford-Fulkerson method always finds a new augmenting path and each augmenting path must has bottleneck capacity at least 1 (due to that integer constraint). Therefore, each iteration increases the flow of at least one edge by at least 1, edging the Ford-Fulkerson closer to termination.
As the number of edges is finite (as well as the finite max capacity per edge), this guarantees the eventual termination of Ford-Fulkerson method when the max flow mf is reached and there is no more augmenting path left.
In the worst case, Ford-Fulkerson method runs for mf iterations, and each time it uses O(E) DFS. The rough overall runtime is thus O(mf × E).
Idea: What if we don't consider any augmenting paths but consider augmenting paths with the smallest number of edges involved first (so we don't put flow on more edges than necessary).
Implementation: We first ignore capacity of the edges first (assume all edges in the residual graph have weight 1), and we run O(E) BFS to find the shortest (in terms of # of edges used) augmenting path. Everything else is the same as the basic Ford-Fulkerson Method outlined earlier.
It can be proven that Edmonds-Karp will use at most O(VE) iterations thus it runs in at most in O(VE * E) = O(VE^2) time.
This is a stub.
Dinic's run in a faster time O(V^2 × E) due to the more efficient usage of BFS shortest path information.
We can constructively identify the edges in the Min-Cut after running any Max-Flow algorithm until it terminates.
Details later, this is a stub.
When you are presented with a Max Flow (or a Min Cut)-related problem, we do not have to reinvent the wheel every time.
You are allowed to use/modify our implementation code for Max Flow Algorithms (Edmonds-Karp/Dinic's): maxflow.cpp|py|java|ml