Record Details


Field	Value

ISSN	2579-907X 2460-3333

Authentication Code	dc

Title Statement	PERBANDINGAN ALGORITMA DJIKSTRA DAN WARSHALL DALAM PENENTUAN LINTASAN TERPENDEK KE KOTA KLATEN

Added Entry - Uncontrolled Name	Retnowati, Niken Lutfiyani, Rizka Safitri Universitas Widya Dharma Klaten

Summary, etc.	Search for the shortest path is a problem that is faced when we want to travel or go somewhere. Klaten City is one of the cities in Central Java. Cities around Klaten include Boyolali. When we go to Klaten city there are several alternative roads or trails that can be chosen from Boyolali. Mathematically this condition can be applied in graphical form to find the shortest path to the city of Klaten. Determination of the shortest path can be found using the Djikstra Algorithm and the Warshall Algorithm. Researchers tried to compare the two methods to get the most optimal result. From the study concluded that the Djikstra algorithm is more effective than the Warshall algorithm for the shortest path from Boyolali to Klaten.

Publication, Distribution, Etc.	Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan

Electronic Location and Access	application/pdf http://e-jurnal.unisda.ac.id/index.php/ujmc/article/view/1132

Data Source Entry	Unisda Journal of Mathematics and Computer Science (UJMC); Vol 4 No 2 (2018): Unisda Journal of Mathematics and Computer Science

Language Note	eng

Terms Governing Use and Reproduction Note	##submission.copyrightStatement##

Jurnal Pendidikan Tinggi Nahdlatul Ulama Jawa Timur