微计算机信息
微計算機信息
미계산궤신식
CONTROL & AUTOMATION
2010年
3期
143-145
,共3页
网络最大流%算法%最大流问题%最小截
網絡最大流%算法%最大流問題%最小截
망락최대류%산법%최대류문제%최소절
The maxhnum flows%Algorithm%Maxhmum flow problem%The minirnum cut
近年采,随着各种网络的飞速发展,对最大流问题的研究也取得了很大的进展.文章简述了网络最大流问题的现状,提出了一种求解网络最大流与最小截问题的算法.此算法使得计算网络最大流变得简便,且具有很强的实用性.
近年採,隨著各種網絡的飛速髮展,對最大流問題的研究也取得瞭很大的進展.文章簡述瞭網絡最大流問題的現狀,提齣瞭一種求解網絡最大流與最小截問題的算法.此算法使得計算網絡最大流變得簡便,且具有很彊的實用性.
근년채,수착각충망락적비속발전,대최대류문제적연구야취득료흔대적진전.문장간술료망락최대류문제적현상,제출료일충구해망락최대류여최소절문제적산법.차산법사득계산망락최대류변득간편,차구유흔강적실용성.
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.
