IMPLEMENTATION OF DIJKSTRA'S ALGORITHM FOR FINDING THE SHORTEST ROUTE BETWEEN THE OFFICE AND THE ESTIMATED PETROL COST (CASE STUDY PT. TELKOM INDONESIA REGIONAL IV JATENG-YOGYAKARTA)

  • Fairuz Eka Andiany
  • Wiwien Hadikurniawati
Keywords: Dijkstra’s Algorithms, shortest path, petrol estimate

Abstract

ABSTRACT

                Employees get adequate facilities to support working. PT Telkom Indonesia provides car loan facilities for employee mobility. For employees with divisions whose work has high mobility, cars and costs needed to facilitate going to the destination. Borrowing the car with a predetermined procedure. Web was chosen as a means to borrow cars. The web that is created not only requires regular web, but also comes with an algorithm to find costs of petrol. The algorithm that is used is Dijkstra's algorithm. Based on literature study, Dijkstra's algorithm is able to determine the shortest route for a predetermined purpose.

DB Error: Table './ojs/metrics' is marked as crashed and last (automatic?) repair failed