@thesis{thesis,
		author={Danny Matthew  and PRATAMA  SURACHMAD and Rifkie },
		title ={PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA FLOYD WARSHALL PADA PENCARIAN RUTE PARIWISATA DI KOTA PALEMBANG},
		year={2018},
		url={https://repository.unsri.ac.id/10013/},
		abstract={Route search from one point to another is a problem that is often encountered in everyday life. Various groups have encountered similar problems with different variations. Dijkstra and Floyd Warshall algorithms are used to find the optimal route to tourism locations in Palembang. In applying the Dijksta algorithm and the Floyd Warshall algorithm on the search for tourism routes in Palembang city data is needed in the form of nodes, edges to create graph maps, congestion, one way roads and vehicle speeds. Tests were carried out using 9 hotel locations and 10 tourism locations in Palembang in the case of single destrination and multi destination. From the results of the study the optimal results obtained by Dijkstra's algorithm and Floyd Warshall's algorithm, and Dijkstra's algorithm use less memory and route search process times faster than the Floyd Warshall algorithm.}
		}