@thesis{thesis,
		author={Ikmal  Muhammad},
		title ={Implementasi Algoritma Dijkstra Dalam Menentukan Jarak Rute Terpendek Lokasi Barbershop},
		year={2022},
		url={http://eprints.polbeng.ac.id/6864/},
		abstract={The problem of finding the shortest route distance along with the shortest 
time savings. This becomes important in the dynamics of urban society. The
number of routes taken is also a separate obstacle and problem to reach its
destination. Determining the shortest route distance is an optimization problem.
In this study, the researchers determined the shortest route to the barbershop
location as the destination. Therefore, finding the location of the shortest route
distance to the Barbershop location requires a dijkstra algorithm application
system that can make it easier to find out the location and distance of the shortest
route to the Barbershop. And the purpose of this research is to be able to help the
community to find the shortest route distance that can be taken to the location of
the Barbershop. The system for implementing this dijkstra algorithm uses a leaflet
library to make it easier to make regional maps. And focuses on determining the
distance of the shortest route to the Barbershop location.}
		}