基于图论的物流配送最短路径比较研究

Research on Comparative of Logistics Shortest Path Based on Graph Theory

通过实例对比分析Dijkstra算法和Floyd算法特点及适用性,选用Dijkstra算法计算物流配送的最短路径,给出Dijkstra算法求解最短路径问题的实现方法及步骤并集成了一个小型系统,使用随机生成的数据进行最短路径求解,将生成的最短路径在随机生成的图上进行演示,并计算出两种算法执行时间,以期对物流配送中点对点的最短路径有所帮助。

Dijkstra and Floyd algorithms are analyzed in solving the shortest Path of logistics by example,Dijkstra algorithm is selected in logistics shortest path and give the shortest path problem of implementation are gave and a small system is integrated.Random data is used to solve the shortest path,result to help in finding the shortest path in logistics and distribution in Graph.