A single source shortest path algorithm for a planar distributed network

2005 ◽  
pp. 143-150 ◽  
Author(s):  
Greg N. Frederickson
Keyword(s):  
Shortest Path ◽  
Distributed Network ◽  
Single Source ◽  
Shortest Path Algorithm

scholarly journals An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 421
Author(s):  
Mina Asaduzzaman ◽  
Tan Kim Geok ◽  
Ferdous Hossain ◽  
Shohel Sayeed ◽  
Azlan Abdaziz ◽  
...  
Keyword(s):  
Shortest Path ◽  
Real World ◽  
Indoor Environment ◽  
Minimum Weight ◽  
Single Source ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Real World Data ◽  
Minimal Weight ◽  
Multiple Item

The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially in supermarkets, warehouses, libraries, etc. However, when it is used for multiple item searches, its weight becomes higher as it searches only the shortest path between the single sources to each destination item separately. If the conventional Dijkstra algorithm is modified to multi-destination mode then the weight is decreased, but the output path is not considered as the real shortest path among multiple destinations items. Our proposed algorithm is more efficient for finding the shortest path among multiple destination items with minimum weight, compared to the single source single destination and modified multi-destinations of Dijkstra’s algorithm. In this research, our proposed method has been validated by real-world data as well as by simulated random solutions. Our advancement is more applicable in indoor environment applications based on multiple items or destinations searching.

Parallel Implementation of Single-Source Shortest Path Algorithm Based on Haloop

2012 ◽  
Vol 220-223 ◽  
pp. 2428-2432 ◽  
Author(s):  
Yuan Sheng Lou ◽  
Wen Yuan Zhang ◽  
Feng Xu ◽  
Yu Wang ◽  
Sheng Chen
Keyword(s):  
Shortest Path ◽  
Parallel Implementation ◽  
Program Execution ◽  
Single Source ◽  
Shortest Path Algorithm ◽  
Typical Problem ◽  
Mapreduce Framework ◽  
Programming Framework ◽  
Wide Range ◽  
Hadoop Framework

As a typical problem of graph theory, Single-Source Shortest Path(SSSP) has a wide range of applications and research. The traditional MapReduce framework such as Hadoop has been applied to SSSP problem. However, in this way, it may need writing and reading the disk frequently, transmitting data largely, beacuse of SSSP’s iterative. Haloop is a parallel programming framework which makes an improvement based on Hadoop framework, and adapts itself to iterative programming. Hence, this article represents the SSSP problem with an iterative way firstly, and then we put forward the implementation mechanism of SSSP algorithm based on Haloop. Though testing and analyzing, the implementation based on Haloop obviously improves the efficiency of program execution, compared with the traditional realization mechanism.

Sign in / Sign up

Export Citation Format

Share Document