Implementation of Dijkstra's Algorithm in the Shortest Route

Abstract

Efficient travel in terms of distance, time and cost are the needs of every traveler. Not all travelers always make careful planning before going on a trip and it could be that the trip is done unexpectedly. In order to help travelers to get a wellplanned trip, technological utilization is needed so that travelers can easily get the shortest distance on the route. Smaller distances can optimize usage costs and possibly travel time. One of them is the creation of the website-based shortest route search destination search application with a mobile friendly display. The dijkstra algorithm is one of the algorithms for determining the shortest route from one tourist attraction to another. The calculation of the dijkstra algorithm begins with determining the node (point) that will be formed into a graph.

Jeodezik-Tabanlı Dijkstra Algoritması Kullanılarak Açılabilir Yüzey Üzerinde İki Nokta Arasındaki Optimal En Kısa Yolun Elde Edilmesi

“…Dijkstra'nın algoritmasının temel fikri bir karşılaştırma döngüsüdür [26]. Dijkstra algoritmasının adımları aşağıda verilmiştir [27]…”