论文部分内容阅读
网络最大流问题目前的解法是标号算法,现提出矩阵解法。此方法能求出N网络最大流,并打印出网络流量实际分配情况。 采用N·N方阵存放网络各边的额定容量,其对角线元素存放节点流量不平衡值。通过消负、转移、减流、消正四个步骤将节点流量调正到平衡状态,此时两端点为最大流,其余元素表示流量实际情况。 本文介绍了计算机语言程序及使用方法。
The current solution to the problem of the maximum network flow is the labeling algorithm, and the matrix solution is proposed. This method can find the maximum flow N network, and print out the actual distribution of network traffic. The N · N square matrix is used to store the rated capacity of each side of the network, and the diagonal elements store the node traffic imbalance value. The flow of nodes is adjusted to equilibrium through four steps of negative elimination, transfer, reduction, elimination and elimination. In this case, the two endpoints are the maximum flow, and the remaining elements represent the actual situation of the flow. This article describes computer language programs and how to use them.