Ford-Fulkerson algorithm
最大流算法，用于计算流网络中的最大流量
Maximum flow minimum cut theorem 最大流最小割问题
[Traffic Problem] You got re-elected as the Mayor of Auckland and now need to deliver your election promise to improve the traffic congestion problem. The graph below shows six inner-city locations and the capacities of the roads linking these locations. Your task is to find out how much traffic does this road layout allow to go from the location s to the location t and where the bottleneck is.
(a) Compute the maximum flow f by applying the Ford-Fulkerson algorithm. Show your working by drawing the current flow and residual graph after each iteration of the algorithm.
(b) Identify a minimal cut in the network.
(a)
(b)
先知道一个概念，最大流一定是小于等于最小割的
cut A-C
A-D
B-C
B-D
so we can get minimum cut is 11