网络优化算法的实现与比较

以实际“物流决策支持系统”项目为背景,讨论了网络的邻接矩阵、关联矩阵、邻接表、弧表、星型表示法等计算机存储表示在处理实际问题时的优缺点,选用邻接矩阵、邻接表表示法设计实现了最短路算法和最大流算法,通过分析、测试Ford-Fulkerson算法、最大容量增广路算法、Dinic算法、最高标号预流推进算法等,给出了各算法的不同实现方法对实际问题的适应性及在运行效率上的差别。

Implementation and comparison of network optimization algorithms

The presentation of computer network storage such as adjacency matrix, incidence matrix, adjacency lists, arc list and star is discussed based on the "Materials Circulation Decision Support System" project.The shortest path algorithms and maximum flow algorithms are designed and implemented using adjacency matrix and adjacency lists. Those algorithms such as Ford Fulkerson algorithm, max capacity augmenting path algorithm, dinic algorithm, highest label preflow push algorithm etc are analyzed and tested. The adaptability and run time efficiency of different implementation of each algorithm is also presented.