scholarly journals Implementation of Dijkstra Algorithm with React Native to Determine Covid-19 Distribution

SISTEMASI ◽  
2022 ◽  
Vol 11 (1) ◽  
pp. 160
Author(s):  
Rosyid Ridlo Al Hakim ◽  
Purwono Purwono ◽  
Yanuar Zulardiansyah Arief ◽  
Agung Pangestu ◽  
Muhammad Haikal Satria ◽  
...  
Keyword(s):  
Information Technology ◽  
Programming Language ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Global Pandemic ◽  
Android Os ◽  
Shortest Distance ◽  
The World

Since Covid-19 was declared a global pandemic because it has spread throughout the world, every effort has been made to help prevent and tackle the transmission of Covid-19, including information technology. Information technology developed to determine the shortest distance for Covid-19 cases around us needs to be developed. This research implements Dijkstra's Algorithm written in the React Native programming language to build a Covid-19 tracking application. The system can display the closest distance with a radius of at least one meter, and the test results can map the nearest radius of 41 meters and the most immediate radius of 147 meters. This system is built for the compatibility of Android OS and iOS applications with React Native programming.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

scholarly journals Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

2019 ◽  
Vol 7 (2) ◽  
pp. 8
Author(s):  
Tri Setya Dermawan
Keyword(s):  
Programming Language ◽  
Time Complexity ◽  
Route Discovery ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Web Based ◽  
Dijkstra's Algorithm ◽  
Comparison Results ◽  
Minimum Price ◽  
Memory Complexity

Abstract - The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization.Based on the comparison results from the implementation that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.

scholarly journals Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra

2020 ◽  
Vol 164 ◽  
pp. 10016
Author(s):  
Mikhail Urubkin ◽  
Vasiliy Galushka ◽  
Vladimir Fathi ◽  
Denis Fathi ◽  
Sofya Petrenkova
Keyword(s):  
Relational Algebra ◽  
Management Systems ◽  
Dijkstra’S Algorithm ◽  
Topical Issue ◽  
Dijkstra Algorithm ◽  
System Architectures ◽  
Dijkstra's Algorithm ◽  
Path Search ◽  
Sql Language ◽  
The Impact

The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of the Transact-SQL language. The efficiency of the known information system architectures and the impact of various ways of distributing functions between system components are reviewed. The article describes features of the relational algebra and the Transact-SQL operations, and provides a brief description of Dijkstra’s algorithm. For its programmatic implementation, several stages are defined, for each of which a formal description of the relational operations performed on it is given. The outputs of these operations are shown using the example of the database tables, and the algorithm to find the final path is given. The issues of the proposed method’s productivity and security of programmatic implementation of the path search in a graph are discussed separately.

scholarly journals The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph

2021 ◽  
Vol 348 ◽  
pp. 01001
Author(s):  
Paryati ◽  
Krit Salahddine
Keyword(s):  
Shortest Path ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Application System ◽  
Path Creation ◽  
Dijkstra's Algorithm

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path.

scholarly journals Reliability study on the adaptation of Dijkstra’s algorithm for gateway KLIA2 indoor navigation

2020 ◽  
Vol 9 (2) ◽  
Author(s):  
K. A. F. A. Samah ◽  
A. A. Sharip ◽  
I. Musirin ◽  
N. Sabri ◽  
M. H. Salleh
Keyword(s):  
Indoor Environment ◽  
Indoor Navigation ◽  
Dijkstra’S Algorithm ◽  
Reliability Study ◽  
Dijkstra's Algorithm ◽  
Current Location ◽  
Shortest Distance ◽  
Level 2 ◽  
Test Result

This paper describes a reliability study on the adaptation of Dijkstra’s Algorithm (DA) in the indoor environment for navigation purposes. Gateway KLIA2 located at Sepang, Selangor, Malaysia has been chosen as the area for case study. Gateway KLIA2 is divided into 4 levels but this research focused on Level 2 only that consists of 129 shop lots. A survey conducted towards 68 public respondents before the adaptation and most of them responded that they are not aware of the surrounding of KLIA2 and are facing difficulties in finding the information or location of certain places inside the building. DA was chosen because it helps the users to navigate using the shortest path to destination. It is proven that through the adaptation of DA, we are able to provide the shortest distance for indoor navigation from current location to the destination location. G-INS is reliable based on the functionality and reliability testing conducted towards 15 users with the distance reduction of 47% t-test result of 0.01303 (p0.05), indicates the system is accepted

scholarly journals PERANCANGAN APLIKASI SISTEM INFORMASI KEPENDUDUKAN DI KECAMATAN GONDOMANAN

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Dwi Broto Bagus Setiawan
Keyword(s):  
Information Technology ◽  
Information System ◽  
Information Systems ◽  
Data Processing ◽  
Programming Language ◽  
Technology Development ◽  
Large Data ◽  
Manual Method ◽  
The World ◽  
Information Technology Development

Information technology development is very fast in the last decade was veryinfluential on various aspects of life in the world in general and Indonesia in particular.Especially offices that have access to large data processing, because the data processing is nolonger possible to use the manual method because it is less effective and efficient. Likewise withGondomanan District, Yogyakarta are still using simple applications such as excel in the sensethat less rapidly. For that create an information system that could facilitate performancekepependudukan Gondomanan District, Yogyakarta. With the use of information systems, it is possible the optimization of the work and service functions to achieve good services as needed,including the optimization of the system in the handling of population, especially in theinformation system that could facilitate performance kepependudukan Gondomanan District,Yogyakarta. Then produced an information system that is easy, interactive, fast, and useful. Thesystem uses the Apache server, PHP programming language and MySQL database

Research on emergency rescue plan of plateau area after earthquake based on road accessibility

2020 ◽  
Author(s):  
Junming Li
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Mountainous Areas ◽  
The Road ◽  
Emergency Rescue ◽  
Dijkstra's Algorithm ◽  
Plateau Area

<p>Road damage in plateau mountainous areas has a significant impact on emergency rescue, and the size of the area where emergency rescue vehicle teams travel at different rescue stages is different, which also gives rise to different considerations of road demand. Current research finds that the respective characteristics of Dijkstra's algorithm and ant colony algorithm can meet the different needs of emergency rescue vehicle teams when they are traveling at different regional sizes. Therefore, the article simulates the earthquake and calculates the road accessibility results after the earthquake, and then considers the differences in road demand and considers the size of different regions, the Dijkstra algorithm and the ant colony algorithm are used respectively to plan the overall emergency rescue plan by setting different scenarios. The results show that the emergency rescue-planning route in different scenarios provided by the plan is scientific and reasonable, and can provide support in the research of key links.</p>

scholarly journals PENERAPAN ALGORITMA DIJKSTRA DALAM PENENTUAN LINTASAN TERPENDEK MENUJU UPT. PUSKESMAS CILODONG KOTA DEPOK

2021 ◽  
Vol 14 (1) ◽  
pp. 81-92
Author(s):  
Cicih Sri Rahayu ◽  
Windu Gata ◽  
Sri Rahayu ◽  
Agus Salim ◽  
Arif Budiarto
Keyword(s):  
Health Center ◽  
Shortest Path ◽  
Research Method ◽  
Health Centers ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Final Destination ◽  
Shortest Distance ◽  
Starting Point ◽  
The Government

One of the government's efforts in providing health to the community is the construction of health centers in each sub-district, and the community is expected to be able to take advantage of the health facilities provided by the government. One of the problems that exist in the community is determining the shortest distance to the puskesmas. In Depok City, there are 26 routes that can be passed from the 38 nodes or vertices to the Cilodong Health Center with the starting point of the Depok mayor's office. This study uses a survey research method to calculate the actual distance at each node or vertex, the purpose of this study is to determine the shortest path taken by the starting point from the Depok mayor's office to get to the Cilodong Health Center by applying the dijkstra algorithm. This dijkstra algorithm works by visiting all existing points and making a route if there are 2 routes to the same 1 point then the route that has the lowest weight is chosen so that all points have an optimal route. This quest continues until the final destination point. After doing this research and testing using a simple application to calculate the distance by applying the djikstra algorithm, it was found that the shortest path taken to the destination is through the GDC Main Gate or on the test results in Iteration 26. From the results of this study, people can choose this closest route to save time when viewed from the distance of the existing track. For further research, it is expected to be able to compare two other algorithms and other parameters so that the closest route with the fastest time is obtained.

scholarly journals Digitalization On Students Scoring System of SMPN 18 Bekasi

2019 ◽  
Vol 13 (3) ◽  
pp. 283
Author(s):  
Fesa Asy Syifa Nurul Haq ◽  
Nuryuliani Nuryuliani
Keyword(s):  
Information Technology ◽  
Information System ◽  
Programming Language ◽  
Scoring System ◽  
School Services ◽  
The World ◽  
Academic Information ◽  
New Policies ◽  
To Receive

 Information technology has been supporting the development of school services in the world. But there are still many schools does not using the information technology at all - specially in Indonesia, for example at SMPN 18 Bekasi. As usually like another school they only using Ms. Word and Ms. Excel applications. That is make many differences output in format scoring and mistakes while filling score on the students report format. The application of academic information system in this research have developed using PHP, HTML and MySQL as programming language. It named SIADHEL, means Eighteen Academic Information System (Sistem Informasi Akademik Delapan Belas) . The aims of this project is to provide a good tools for students or their parents to receive the exactly, fast and accurate informations of their students scoring. Teachers can use an integrated and accurate tools as facility to provide data for the Principal to make new policies.  This application could be opened by every browser platform, so it will make easier for the users to access the program wherever and anytime.

scholarly journals The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

2021 ◽  
Vol 3 (2) ◽  
pp. 185-202
Author(s):  
Melki Friaswanto ◽  
◽  
Erick Alfons Lisangan ◽  
Sean Coonery Sumarta
Keyword(s):  
Fire Department ◽  
Fire Service ◽  
Traffic Signal ◽  
Fast Time ◽  
Dijkstra’S Algorithm ◽  
Dijkstra Algorithm ◽  
Traffic Lights ◽  
Dijkstra's Algorithm ◽  
Simulation Results ◽  
Fire Location

The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others. The result of this research is a system that can assist firefighters when handling fire cases in terms of accelerating the firefighting team to the location of the fire. Dijkstra's algorithm will be used to find the shortest path to the fire location and the travel time. Then the traffic signal preemption simulation adjusts the color of the lights when the GPS vehicle approaches the traffic lights on the path to be traversed. The simulation results show that the use of traffic signal preemption in collaboration with Dijkstra's algorithm and GPS can help the performance of the Makassar City Fire Department, especially for handling fires that require fast time.

Sign in / Sign up

Export Citation Format

Share Document