最短路径算法并行化策略的研究与实现  

Research and implementation of the parallel strategy of shortest path algorithm

作　　者：闵思晗 付逸飞[1] 

机构地区：[1]武汉外国语学校,湖北武汉430000

出　　处：《电子测试》2015年第10期17-18,16,共3页Electronic Test

摘　　要：现阶段,随着我国智能交通系统与通信系统的不断发展完善,网络新特性的出现,对于网络中最短路径问题研究具有非常重要的意义。本文主要选取几种最短路径标号串行算法,并在此基础上分别通过网络复制与网络分割策略,对其最短路径进行求解,从而实现最短路径算法并行策略的研究。At present, with the continuous development of the intelligent transportation system and communication system in our country, the emergence of the new features of the network is very important for the research of the shortest path problem in the network. In this paper, we select some of the shortest path label serial algorithm, and on this basis, respectively, through the network replication and network segmentation strategy, the shortest path to solve the problem, so as to achieve the shortest path algorithm parallel strategy.

关 键 词：最短路径算法 并行计算 网络复制 网络分割 

分 类 号：U495[交通运输工程—交通运输规划与管理] TP301.6[交通运输工程—道路与铁道工程]