Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah

Rosyid Ridlo, Al Hakim and Muhammad Haikal, Satria and Yanuar Zulardiansyah, Arief and Agung, Pangestu and Ariep, Jaenul and Revita Desi, Hertin and Dian, Nugraha (2021) Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah. EXPERT Jurnal Manajemen Sistem Informasi dan Teknologi, 11 (1). pp. 42-47. ISSN 27457265

[img] PDF
dijkstra1.pdf

Download (188kB)
Official URL: http://jurnal.ubl.ac.id/index.php/expert/index

Abstract

Dijkstra is a greedy algorithm that gives a choice of several available shortest routes and then provides a solution. The application of Dijkstra's Algorithm in everyday life is very diverse. This study collects research results regarding the application of Dijkstra's Algorithm to solve everyday problems such as the shortest path problem, this mini-review paper can explain the study of Dijkstra's Algorithm for various things, including solving bi-objective shortest routes, multi-objective routes, emergency evacuation, Dijkstra's graph, the connection between LBS features, best route distribution, and fuzzy solution.

Item Type: Article
Additional Information: This Journal was indexed by Crossref, Dimensions, ROAD, BASE, Sinta, GARUDA, and Google Scholars. Thank you for your kind consideration.
Uncontrolled Keywords: Algorithm, Dijkstra, Shortest Routes, Shortest Path
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Academic Faculties, Institutes and Centres > Faculty of Engineering
Depositing User: Arief
Date Deposited: 16 Dec 2021 05:03
Last Modified: 16 Dec 2021 05:03
URI: http://ir.unimas.my/id/eprint/37221

Actions (For repository members only: login required)

View Item View Item