摘要： 最短路径搜索是路径分析中的热点问题，也是物流运输系统的重要功能和关键技术之一。目前解决最短路径问题的方法多半基于Dijkstra算法。该文在分析和研究了Dijkstra算法及其应用的基础上，提出了一种新的解决方法，其不依赖于静态图结构的生成，而是采用集合运算的思想，通过条件约束不断缩小集合范围，得到符合条件要求的集合。给出了与该方法相适应的数据存储结构，使之在第三方物流运输分析系统中实现了最短路径的搜索。

关键词: 最短路径, 集合运算, Dijkstra算法

Abstract: Searching for the shortest path is not only a hot issue in path analysis, but also an important functions and a key technology in logistics transportation system. Current solutions to the shortest path problem are mostly based on Dijkstra algorithm. On the basis of analysis and research of Dijkstra algorithm and its application, this paper launches a new solution which does not depend on the forming of static graph structure, but applies the idea of set calculation to get the set which meets the requirement of terms through gradually reducing the range of set by term restriction. Data storage structure consistent with the solution is launched. The search for the shortest path is accomplished in the application of the solution in the third party’s logistics transportation analysis system.

Key words: shortest path, set calculation, Dijkstra algorithm

中图分类号: 

• TP391