CASPIAN JOURNAL
MANAGEMENT AND HIGH TECHNOLOGIES
The problem of finding the maximum network flow
 |
Read | Afonasenkov Yevgeniy V., Stepanenko Igor A. The problem of finding the maximum network flow // Caspian journal : management and high technologies. — 2012. — №4. — pp. 31-35. |
Afonasenkov Yevgeniy V. - post-graduate student, Volgograd State Technical University, 28 Lenin av., Volgograd, 400131, Russian Federation, stepanenkoigor1988@yandex.ru
Stepanenko Igor A. - post-graduate student, Volgograd State Technical University, 28 Lenin av., Volgograd, 400131, Russian Federation, stepanenkoigor1988@yandex.ru
This article covers the problem of finding the maximum network flow, i.e. determining the optimal route of the data packets from their original sites to their destination node through a switching center. In so doing, the critique says it is necessary to find the maximum speed of delivery of the product from source to drain, within the capacity constraints. In the paper’s view, this is one of the problems arising in transportation networks, and this document contains an efficient algorithm for resolving it. Moreover, the basic techniques used in this algorithm for solving the maximum flow could be applied to other related problems in the transport sector. In the course of the discussion, concepts such as transportation network, directed graph and edge of graph are defined, and a formal definition is given for the challenges related to maximum flow. Furthermore, the verbal description of the algorithm for resolving this problem is assessed in detail in the basic steps of the algorithm. In conclusion, this blueprint provides a simple example illustrating the algorithm for finding the maximum network flow, noting both the advantages and disadvantages of this procedure.
Key words: flow,algorithm,network,maximum flow,graph,problem,node,source,switching node,runoff,undirected network,best route,capacity,information