Development and research of the algorithm for determining the maximum flow at distribution in the network
An upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution i...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2016-12-01
|
| Series: | Open Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/comp-2016-0017 |
| Summary: | An upgraded version of Ford-Fulkerson algorithm
is proposed, which allows to determine the maximum
flow and the distribution flow in branches of the network.
Results of simulation using this algorithm are given.
They show its effectiveness in comparison with the other
variants of flow distribution in the network at change of
the capacity of branches randomly in time. |
|---|---|
| ISSN: | 2299-1093 |