PENERAPAN ALGORITMA DJIKSTRA PADA PENCARIAN JALUR TERPENDEK

Authors

  • Ely Stya Arga Universitas Widyatama
  • Gun Gun Firmansyah Universitas Widyatama
  • Khairul Imam Universitas Widyatama
  • Muchammad Fauzi Universitas Widyatama

DOI:

https://doi.org/10.46306/bay.v1i2.15

Keywords:

Algoritma Djikstra, Greedy, Jalur terpendek, Optimasi Waktu, Djikstra Algorithm, Shortest Path, Time Optimization

Abstract

The development of the times demands an effective and efficient method of activity. One of them is the method for determining the path. Dynamic human activities and being required to make displacement require a method that helps in determining the shortest path. Determining the shortest path has a reason to save fuel, time and power. One method that can be used for closest distance search is to use Dijkstra's algorithm. Dijkstra algorithm is an algorithm that applies a graph of direction and weight, where the distance between points is the weight of each arrow. This algorithm will look for the path with the minimum cost between one point and another. In addition, Dijkstra's algorithm can also be used to calculate the total cost or cost of the shortest trajectory that has been formed

References

Ardiani, Farida. 2011. “Penentuan Jarak Terpendek dan Waktu Tempuh Menggunakan Algoritma Dijkstra dengan Pemrograman Berbasis Objek.” Skripsi Universitas Islam Negeri Sunan Kalijaga.

Fakhri. 2008. “Penerapan Algoritma Dijkstra dalam Pencarian Solusi Maximum Flow Problem.” Makalah IF2251 Strategi Algoritmik.

Harahap & Khairina. ”Pencarian Jalur Terpendek dengan Algoritma Dijkstra.” Jurnal & Penelitian Teknik Informatika, No. 2, Vol.2, Hal 19-24, April 2011.

Lubis, Henny Syahriza. 2009. “Perbandingan Algoritma Greedy dan Dijkstra untuk Menentukan Lintasan Terpendek.” Skripsi Universitas Sumatera Utara

Downloads

Published

2021-09-20