Sholla Qisishinna Azzahro , - (2025) PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA FLOYD-WARSHALL UNTUK PENENTUAN LINTASAN TERPENDEK ANTAR BANK DI KABUPATEN PRINGSEWU. FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM, UNIVERSITAS LAMPUNG.
|
Text
1. ABSTRAK -SHOLLA QISISHINNA AZZAHRO.pdf Download (57kB) | Preview |
|
![[img]](http://digilib.unila.ac.id/style/images/fileicons/text.png) |
Text
2. SKRIPSI FULL - SHOLLA QISISHINNA AZZAHRO.pdf Restricted to Repository staff only Download (2MB) | Request a copy |
|
|
Text
3. SKRIPSI TANPA BAB PEMBAHASAN - SHOLLA QISISHINNA AZZAHRO.pdf Download (1MB) | Preview |
Abstract
Satellite-based navigation systems such as GPS (Global Positioning System) have become essential in daily life, especially in assisting with route or path determination from one location to another. Pringsewu Regency, which has a complex road network, serves as a relevant area for applying shortest path determination, particularly between bank locations spread throughout the region. This study compares two shortest path algorithms, namely the Dijkstra Algorithm and the Floyd-Warshall Algorithm, to determine the shortest path between banks in Pringsewu Regency. The comparison is conducted using two types of distance data: Euclidean distance and Haversine distance. The results of this study highlight the effectiveness of each algorithm in terms of computation time and route accuracy. This research is expected to serve as a reference for the development of navigation systems and more efficient route decision-making in the future. Keywords: Shortest path, Dijkstra Algorithm, Floyd-Warshall Algorithm, Euclidean, Haversine.
| Item Type: | Other |
|---|---|
| Subjects: | ?? 500 ?? ?? 510 ?? |
| Divisions: | ?? matematika ?? |
| Depositing User: | UPT . Ery Elyasari |
| Date Deposited: | 19 Nov 2025 07:56 |
| Last Modified: | 19 Nov 2025 07:56 |
| URI: | http://digilib.unila.ac.id/id/eprint/93647 |
Actions (login required)
 |
View Item |