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.

• 用线性规划的投影算法解网络流问题的关键步骤是求枢轴行和枢轴列。