Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport.

Yohana Permata Hutapea (Sam Ratulangi University)
Chriestie E.J.C. Montolalu (Sam Ratulangi University)
Hanny A.H. Komalig (Sam Ratulangi University)

d'Cartesian: Jurnal Matematika dan Aplikasi
Vol 9, No 2 (2020): September 2020

Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.