A Purely-Combined Arc-Exchange Method of the Optimal Circulation
In this paper, a kind of finite algorithm to seek the optimal citculation in digraph is proposed. It is accomplished through a series of arc-exchang between supporty forests and corresponding complementary supporty forests in digraph. The rule of arc-exchange is purely-combined, only relates with minimal order of arrangement of several arce, and irrelevants with verification of minimal ratio , , . It is non-simplex, namely, in the process to carry out it, each circulation and corresponding complentary circulations only keep basic property. Algorithm begins works from a supporty forest arbitrarily given in considered digraph.