摘要
近年来,随着各种网络的飞速发展,对最大流问题的研究也取得了很大的进展。文章简述了网络最大流问题的现状,提出了一种求解网络最大流与最小截问题的算法。此算法使得计算网络最大流变得简便,且具有很强的实用性。
Recently,with the rapid development of various networks,the research on the maximum flow problem has made remarkable achievements.In this article,the condition of the maximum flow problem is proposed and presents a algorithm for the solution to the maximum flow problem of networks and minimum cut.The way of the algorithm in the paper is not only simpler but also more practi cality than the other algorithm＇s.
出处
《微计算机信息》
2010年第3期143-145,共3页
Control & Automation
关键词
网络最大流
算法
最大流问题
最小截
The maximum flows
Algorithm
Maximum flow problem
The minimum cut
