Solve of the Minimum Saturated Flow in the Transportation Network

In a transportation network,blockage is a kind of phenomenon commonly happened because of uncontrollable flow.The saturated flow of blocking network is less than the maximum flow.It is an important parameter in designing a transport network,especially an emergency evacuation network.Find the blocking section through the cutting-set matrix.An algorithm is proposed to solve the minimum saturated flow.An example is shown that this algorithm is simple and applicable.