Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah
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 ev...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Pusat Studi Teknologi Informasi, Fakultas Ilmu Komputer, Universitas Bandar Lampung
2021
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/37221/1/dijkstra1.pdf http://ir.unimas.my/id/eprint/37221/ http://jurnal.ubl.ac.id/index.php/expert/index http://dx.doi.org/10.36448/expert.v11i1.1939 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|