ANALISIS PERBANDINGAN PADA ALGORITMA BELLMAN FORD DAN DIJKSTRA PADA GOOGLE MAP

  • Bayu Irawan Ahmad Prasetyo Universitas Putera Batam
  • Andi Maslan Universitas Putera Batam
Keywords: Bellman Ford, Dijkstra, Shortest Track Path, Google Map

Abstract

The Bellman Ford algorithm and the Dijkstra algorithm are often used in determining the shortest path. Bellman Ford's Algorithm and Dijkstra's Algorithm have the same way of working because both algorithms have the same strategy, Greedy. In the Greedy strategy the first step taken is to choose the side with the smallest weight among all sides connected from the initial node to the neighbor node. Compared to the Dijkstra algorithm, the Bellman Ford algorithm is superior because the Bellman Ford algorithm can complete calculations on graphs that have negative values. Determination of the shortest path using the Bellman Ford algorithm and the Dijkstra algorithm as a route reference used in determining the route from the Tembesi campus to the Tiban campus. This research was conducted to compare the two algorithms on the Google Map in terms of both the complexity of the space and the complexity of the time needed to provide a sol

Published
2020-06-08
How to Cite
Prasetyo, B. I., & Maslan, A. (2020). ANALISIS PERBANDINGAN PADA ALGORITMA BELLMAN FORD DAN DIJKSTRA PADA GOOGLE MAP. Khazanah Ilmu Berazam, 3(2), 337 - 349. Retrieved from http://ejournal.ymbz.or.id/index.php/KIB/article/view/187