The research is made in this article on evaluation of maximalflow in network, giving the growth tree evaluation on maximalflow of network by drawing the tree map.
本文对网络中最大流问题的求法进行了探索。利用画树图，给出了网络最大流的生长树求法。
2
Network bottleneck restricts the maximalflow of the entire network.
网络最大流的瓶颈制约整个网络的最大流。
3
On the algorithm of the networkmaximalflow, the paper provides a method of achieving it.