摘要
提出了一个深度优先搜索最大流问题的分布式新算法,算法脱离了增广路径框架,具有一定的创新性,而且通俗易懂、形式规范,无论用于教学还是解决实际问题,都有较大的实用价值。
The new algorithm of finding maximum flows using DFS technique has 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.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第33期38-39,45,共3页
Computer Engineering and Applications
关键词
深度优先搜索
增广路径
有向流网络
弧容量
弧流量
最大流
DFS （Depth_First Search ）
augmenting -path
directed flows network
capacity of the edge
capacity of the flow
maximum flow
