计算机与数字工程2012，Vol.40Issue(4)：22-23,129,3.
基于图论的物流配送最短路径比较研究
Research on Comparative of Logistics Shortest Path Based on Graph Theory
王华1
作者信息
- 1. 陕西交通职业技术学院 西安 710014
- 折叠
摘要
Abstract
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.关键词
Dijkstra/Flody/最短路径/图/物流配送Key words
Dijkstra/ Flody/ shortest path/ graph/ Logistics分类
信息技术与安全科学引用本文复制引用
王华..基于图论的物流配送最短路径比较研究[J].计算机与数字工程,2012,40(4):22-23,129,3.
