网络最大流求解算法的研究  

Research on the Algorithm for the Solution to the Maximum Network Flow Problem

作　　者：孙泽宇[1] 丁国强[1] 程志谦[1] 

机构地区：[1]洛阳理工学院计算机与信息工程系,河南洛阳471023

出　　处：《微计算机信息》2010年第3期143-145,共3页Control & Automation

摘　　要：近年来,随着各种网络的飞速发展,对最大流问题的研究也取得了很大的进展。文章简述了网络最大流问题的现状,提出了一种求解网络最大流与最小截问题的算法。此算法使得计算网络最大流变得简便,且具有很强的实用性。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.

关 键 词：网络最大流 算法 最大流问题 最小截 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]