JURNAL DERIVAT: JURNAL MATEMATIKA DAN PENDIDIKAN MATEMATIKA
Vol. 11 No. 1 (2024): Jurnal Derivat (April 2024)

Minimum Spanning Tree Rute Shopping Mall Di Surabaya Menggunakan Algoritma Prim

Amalia, Nabila Tasya (Unknown)
Novianti, Fahriza (Unknown)
Yasmin, Yasirah Rezqita Aisyah (Unknown)



Article Info

Publish Date
30 Apr 2024

Abstract

Surabaya as the second most populous city in Indonesia often carries out developments on land, one of which is the construction of a shopping center. The large number of shopping center developments has made both local and foreign residents want to visit shopping centers in Surabaya. There are 9 most popular shopping centers used in this study. The purpose of this research is to determine the shortest route between shopping centers in Surabaya by using the prim algorithm. This algorithm determines the shortest route by forming a minimum spanning tree. The results obtained in this study are the shortest travel time from 9 shopping centers is 81 minutes with a distance of 31.5 KM.  Keyword: Prim Algorithm, Graph, Rute, Surabaya

Copyrights © 2024






Journal Info

Abbrev

derivat

Publisher

Subject

Education

Description

Jurnal Derivat: Jurnal Matematika dan Pendidikan Matematika, e-ISSN: 2549-2616, p-ISSN: 2407-3792 Is an information container containing scientific articles of research, literature studies, ideas, the application of theory, the study of critical analysis, and Islamic studies in the field mathematics ...