Nurhandayani, Poetri Hana and Wamiliana, Wamiliana and Misgiyati, Misgiyati and Notiragayu, Notiragayu and Ansori, Muslim (2024) The Comparison of Dijsktra’s Algorithm and Flyod Warshall’s Algorithm to Determine The ShortestPath of Traditional Markets in Bandar Lampung City. Explore (Jurnal Sistem Informasi dan Telematika), 15 (1). pp. 131-139. ISSN 2087-2062

Text The Comparison of Dijsktra’s Algorithm and F W _Traditional Markets.pdf Download (774kB)

Abstract

Determining the shortest path between one location to another location is one of the problems that usually has to be faced in daily life. The shortest path will affect the shorter time needed, less money used, and others. In this study, we will discuss the comparison of Dijsktra’s Algorithm and Floyd Warshal’s Algorithm to determine the shortest path of the biggest and the most famous traditional market in Bandar Lampung City, which is Bambu Kuning traditional market, to 26 other traditional markets in Bandar Lampung city. The Phyton programming language is used to implement both algorithms on the data of 27 traditional markets. The results show that both algorithms give the same solution. However, the processing time of Dijsktra’s Algorithm (0.1063 seconds) is faster than Floyd Warshal’s algorithm (0.1691 seconds)

Item Type:	Article
Subjects:	Q Science > QA Mathematics
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User:	WAMILIANA
Date Deposited:	04 Jul 2024 02:55
Last Modified:	04 Jul 2024 02:55
URI:	http://repository.lppm.unila.ac.id/id/eprint/53967

Actions (login required)

View Item