摘要
给出了计算网络最大流的表格法,避免了标号法(由Ford Fulkerson提出)在计算最大流过程中选择增流链的随机性,并通过实例给出了具体算法步骤.
The method of calculating the maximum flow in network picture is given.The method avoids from finding the zip of growing flow put forword by Ford-Fulkerson in the sign method,and a practical step of calculating is introduced by a example.
出处
《烟台师范学院学报（自然科学版）》
2005年第2期109-110,共2页
Yantai Teachers University journal(Natural Science Edition)
关键词
最大流
可行流
增流链
不饱和弧
maximum flow
flexible flow
the zip of growing flow
unsaturated arc
