摘要
用线性规划的投影算法解网络流问题的关键步骤是求枢轴行和枢轴列。介绍了如何从图中求出枢轴行和枢轴列以及图算法中一些常用的运算公式。
The
key step in many graphic algorithms for network flow problems is to find the pivoting row and
column so that a pivoting can be completed in linear time.This paper presents all the formulas for
such a pivoting operation.
