The research is made in this article on evaluation of maximal flow in network, giving the growth tree evaluation on maximal flow of network by drawing the tree map.
本文对网络中最大流问题的求法进行了探索。利用画树图，给出了网络最大流的生长树求法。
Network bottleneck restricts the maximal flow of the entire network.
网络最大流的瓶颈制约整个网络的最大流。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
应用推荐