Graphs are a pervasive data structure in computer science, and algorithms for working with them are fundamental to the field. There are hundreds of interesting computational problems defined in terms of graphs. This time we’ll touch one of them – the problem of maximum net flow. One of the main problems in the theory of graphs is the problem of maximum flow. The purpose is to calculate the biggest amount of matter, which can be relayed from the source to the flow. This is one of the easier tasks, which can be solved with the help of algorithms. Beside that the basic algorithms of maximum flow can be used for solving other problems about net flows. The results of this work are: - created the program equipment, realizing four classic methods of calculating maximum flow – Ford-Falkerson, Edmonds-Karp, Dinic and Goldberg; - with the help of this program equipment is collected the statistic of these methods efficiency. Results showed, that every method can be realized within shorter time as was proved earlier.