本文提出的寻找最优断开线集的新方法,无须识别回路,也避免了任何计算过程,只须将网络中的节点控权重递降次序排列,把二维图化为一维节点序列,然后按照使反馈流线的权和减小的规则调整节点在序列中的位置.调整过程结束时保留的逆流线便构成一组断开线集,此时的节点序列便规定了最优计算次序.对文献上通常引用的七个网络图的分解表明,新分解法简单快速,且均给出最优解. In this paper, a new method to find the optimal disconnected line set is proposed, which eliminates the need to identify loops and avoids any computational process. It only needs to arrange the two-dimensional maps into one-dimensional node sequence Adjusting the node’s position in the sequence according to the rules that make the weight of the feedback streamline and decreasing The counter-current lines that remain at the end of the adjustment process form a set of break-line sets, at which point the sequence of nodes specifies the optimal order of calculation. The decomposition of the seven network graphs commonly quoted in the literature shows that the new decomposition method is simple and fast and gives the optimal solution.