2018
DOI: 10.14419/ijet.v7i4.10.26638
|View full text |Cite
|
Sign up to set email alerts
|

Dijkstra Algorithm Application: Shortest Distance between Buildings

Abstract: The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 1 publication
0
8
0
Order By: Relevance
“…These extracted features are then compared with the training features to determine the current location. To find the shortest path from the starting point to the destination, we employ the A* algorithm [12].…”
Section: Related Workmentioning
confidence: 99%
“…These extracted features are then compared with the training features to determine the current location. To find the shortest path from the starting point to the destination, we employ the A* algorithm [12].…”
Section: Related Workmentioning
confidence: 99%
“…The KNN nearest neighbor algorithm was used to remove unnecessary features in an earlier trained module for digit recognition [68]- [70], and determine the user's initial location positioning [71], [72]. A* search algorithm [73], [74], determines the shortest route from the initial point to the destination and suggests it to the users [75], [76]. Through indoor navigation, users can use AR electronic bulletin boards at a particular location to present relevant information about the location [77].…”
Section: Hybrid Trackingmentioning
confidence: 99%
“…It is noted that when the problem size increases, the Dijkstra's algorithm requires longer time to solve the problem. There is an unlimited application using Dijkstra's algorithm to find the shortest path especially in a single source problem [18], [19]. In other work, the large computation has been decreased and the efficiency has been increased by a constrained optimization condition applied to the Dijkstra's algorithm [20].…”
Section: Introductionmentioning
confidence: 99%