路网最大流问题的断路算法程序设计及应用

Programming of Cutting Method in the Problem of Road network Maximal Flow and Its Application

引进交通路网最大流问题求解的断路算法,有效地克服了传统的求解最大流标号法步骤复杂,不利于计算机操作的缺点;以TurboC作为程序实现工具,完成了断路算法的程序设计,程序适用于大型路网中单起点单讫点和多起点多讫点的最大流计算。通过对赣州市现有路网最大通行能力的实例分析,证实了该程序的合理性和有效性,并为本地区未来交通路网规划提供了决策依据。

The cutting method in the problem of road network maximal flow is given, it overcomes some disadvantages of the labeling method The program of cutting method is designed by TurboC The given example of road network maximal flow of Ganzhou city approved the rationality and effectivity of this program, and the result can be taken as decision-making base in district traffic layout