极大流问题的矩阵形式及计算机求解

Matrix form of the maximal flow problem and its solution by using computer

在文献[1]的基础上,将描述流量问题的赋权有向网络图化成赋权矩阵,根据连续定理对节点进行标号,并对赋权矩阵进行计算,将非平衡矩阵化成平衡矩阵,从而求得最大流量。最后给出了计算机求解方法。

Based on the reference[1], this paper transforms the weighting network graph describing the flow problem to weighting matrix. It gives symbols of the jounts according to the continuity theorem, calculates the weighting matrix, trans-forms unbalanced matrix to balanced matrix and solves for the maximal flow.It gives a method solving the maximal flow problem by using computer.