Because the improved algorithm involves the knowledge of the maximal flow problem, this paper also addressed discovering community method based on maximal flow and the symbol algorithm.

Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.

On the algorithm of the network maximal flow, the paper provides a method of achieving it.