Investigation into Applicability and Efficiency of SQLite for Implementation of Dijkstra's Algorithm

被引：0

作者：

Yurchak, Iryna ^{[1
]}

Dudas, Volodymyr ^{[2
]}

机构：

[1] Lviv Polytech Natl Univ, CAD Dept, 12 S Bandery Str, Lvov, Ukraine

[2] Lviv Polytech Natl Univ, Software Dept, 12 S Bandery Str, Lvov, Ukraine

来源：

2017 14TH INTERNATIONAL CONFERENCE: THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS (CADSM) | 2017年

关键词：

Dijkstra's algorithm SQLite implementation; graph algorithms;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The work presents the results of comparison of tools for implementing an algorithm for calculation of the shortest path in a graph in mobile applications. We've revealed the amount of nodes starting from which Dijkstra's algorithm implementation in Java fails or at best becomes inferior to SQL implementation of the same algorithm. The results of the performed investigations come in useful for managers of mobile applications projects when taking decision on the architecture of the application being developed under assumption that the application assumes seeking for the best route and the amount of nodes in a graph representing road network is known in advance.

引用

页码：282 / 284

页数：3

共 50 条

[31] Determination of least polluted route using Dijkstra’s algorithm
B. Deep
International Journal of Environmental Science and Technology, 2023, 20 : 13289 - 13298
[32] Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues
Ros-Giralt, Jordi
Commike, Alan
Cullen, Peter
Lethin, Richard
2018 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2018,
[33] The Improved Dijkstra's Shortest Path Algorithm and Its Application
Wang Shu-Xi
2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1186 - 1190
[34] Micro crack detection with Dijkstra’s shortest path algorithm
Christina Gunkel
Alexander Stepper
Arne C. Müller
Christine H. Müller
Machine Vision and Applications, 2012, 23 : 589 - 601
[35] A dynamic multi source Dijkstra's algorithm for vehicle routing
Eklund, PW
Kirkby, S
Pollitt, S
ANZIIS 96 - 1996 AUSTRALIAN NEW ZEALAND CONFERENCE ON INTELLIGENT INFORMATION SYSTEMS, PROCEEDINGS, 1996, : 329 - 333
[36] Project scheduling in AND-OR graphs: A generalization of Dijkstra's algorithm
Adelson-Velsky, GM
Levner, E
MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (03) : 504 - 517
[37] Determination of least polluted route using Dijkstra's algorithm
Deep, B.
INTERNATIONAL JOURNAL OF ENVIRONMENTAL SCIENCE AND TECHNOLOGY, 2023, 20 (12) : 13289 - 13298
[38] A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices
Barbehenn, M
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (02) : 263 - 263
[39] PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm
Sanchez-Torrubia, M. G.
Torres-Blanc, C.
Lopez-Martinez, M. A.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 224 : 151 - 158
[40] Dijkstra’s algorithm and L-concave function maximization
Kazuo Murota
Akiyoshi Shioura
Mathematical Programming, 2014, 145 : 163 - 177

← 1 2 3 4 5 →