Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah

Rosyid Ridlo Al Hakim (Universitas Global Jakarta)
Muhammad Haikal Satria (Universitas Global Jakarta)
Yanuar Zulardiansyah Arief (Universitas Global Jakarta)
Agung Pangestu (Universitas Global Jakarta)
Ariep Jaenul (Universitas Global Jakarta)
Revita Desi Hertin (Universitas Global Jakarta)
Dian Nugraha (Universitas Global Jakarta)

EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi
Vol 11, No 1 (2021): June

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.