Research of shortest path algorithm based on the data structure

机译：基于数据结构的最短路径算法研究

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

The shortest path problem based on the data structure has become one of the hot research topics in graph theory. As the basic theory of solving this problem, Dijkstra algorithm has been widely used in engineering calculations. Aiming at the shortcomings of traditional Dijkstra algorithm, this paper has proposed an optimization method which has mainly improved the nodes selection of the shortest path and data storage structure and organization. Through comparison and analysis, the improved algorithm has been obtained, which has reduced the storage space, improved the operational efficiency and has a better applicability in the shortest path calculation.

机译：基于数据结构的最短路径问题已成为图论的热点研究课题之一。作为解决这一问题的基础理论，Dijkstra算法已广泛应用于工程计算中。针对传统Dijkstra算法的不足，提出了一种优化方法，主要改进了最短路径的节点选择和数据存储结构与组织。通过比较分析，得到了改进的算法，减少了存储空间，提高了运算效率，在最短路径计算中具有更好的适用性。

著录项

来源
《2012 IEEE 3rd International Conference on Software Engineering and Service Science》|2012年|p.108- 110|共3页
会议地点 Beijing(CN)
作者
Jinhao Lu; Chi Dong;
展开▼
作者单位

Department of Computer Science, Northeast Petroleum University at Qin Huangdao, China;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类软件工程;
关键词

相似文献

外文文献
中文文献
专利

1. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures [J] . Camil Demetrescu, Giuseppe F. Italiano Journal of Discrete Algorithms . 2006,第3期

机译：动态最短路径和传递闭包：算法技术和数据结构
2. An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure [J] . Xin Zhou International Journal of Managing Information Technology . 2014,第1期

机译：基于前向星数据结构的单源最短路径问题的改进SPFA算法
3. INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [J] . S. Behzadi, M. Kolbadinejad International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences . 2019,第4期

机译：遗传算法介绍基于网络结构解决最短路径问题的新方法
4. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths [C] . Gerth Stolting Brodal, Rolf Fagerberg, Ulrich Meyer, Scandinavian Workshop on Algorithm Theory(SWAT 2004); 20040708-20040710; Humlebaek; DK . 2004

机译：无定向广度优先搜索和最短路径的高速缓存不可忽略的数据结构和算法
5. Shortest Path Algorithms for Dynamic Transportation Networks [D] . Alhoula, Wedad. 2019

机译：动态运输网络的最短路径算法
6. Path Optimization along Buoys Based on the Shortest Path Tree with Uncertain Atmospheric and Oceanographic Data [O] . Han Xue, Tian Chai 2021

机译：基于浮标的路径优化基于不确定的大气和海洋数据的最短路径树
7. Dynamic shortest paths and transitive closure: algorithmic techniques and data structures [O] . Demetrescu, C, Italiano, GF 2006

机译：动态最短路径和传递闭包：算法技术和数据结构

Research of shortest path algorithm based on the data structure

摘要

著录项

相似文献

相关主题

期刊订阅