摘要
为了分层实现最大流问题,提出了一种应用DFS策略搜索增广路径,先求得层次网络阻塞流进而最终求得一个最大流的方法。
The algorithm of finding Maximum flows based on level network had been given in the article.There are many good characters with the algorithm,such as easy understanding and standard form.It is worthy not only at teaching but also at practice.
出处
《科技广场》
2008年第1期40-41,共2页
Science Mosaic
关键词
层次网络
饱和弧
阻塞流
增广路径
Level Network
Saturation Edge
Flow Decomposition Barrier
Augmenting Path