Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat

  • Yosua S
  • Sigalingging C
  • Jipesya J
  • et al.
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

The application of technology that is increasingly developing is almost felt to benefit in various aspects of life, one of which is in terms of searching for veterinary clinics. This study aims to help animal owners who have difficulty in finding clinics and shops that sell various kinds of animal needs closest to the user's location. This research uses the Scrum method, which consists of Product Backlog, Sprint Backlog, Sprint and Imcrement. The output from Dijkstra's algorithm can display the location and route of the closest veterinary clinic to application users wherever they are in an average of 4 minutes 29 seconds.

Cite

CITATION STYLE

APA

Yosua, S., Sigalingging, C., Jipesya, J., & Jumaryadi, Y. (2021). Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat. Jurnal Ilmiah FIFO, 13(1), 85. https://doi.org/10.22441/fifo.2021.v13i1.009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free