@phdthesis{digilib59889,
           month = {May},
           title = {IMPLEMENTASI ANTARA ALGORITMA DIJKSTRA DAN ALGORITMA FLOYD WARSHALL UNTUK MENENTUKAN RUTE TERPENDEK PENYELAMATAN KORBAN TENGGELAM DI PANTAI PARANGTRITIS},
          school = {UIN SUNAN KALIJAGA YOGYAKARTA},
          author = {NIM.: 18106010020 Astri Kurniawati},
            year = {2023},
            note = {Pembimbing: Dr. Muhammad Wakhid Musthofa, S.Si., M.Si.},
        keywords = {Dijkstra's Algorithm; Floyd Warshall's Algorithm; Shortest Victim
Rescue Route},
             url = {https://digilib.uin-suka.ac.id/id/eprint/59889/},
        abstract = {every day, but some people ignore the dangers of bathing on the beach when the weather is not favorable so that there are victims of drowning. One of the factors causing the death of drowning victims is the delay in rescue and rescue aids. Efforts that can be made to overcome the problem of delays in rescuing drowning victims from BASARNAS or the Sars Team to Parangtritis beach, one of which is to find the shortest route for the BASARNAS car because besides that, roads or routes are also taken into consideration with the aim of reducing the risk of traffic jams for victims. In solving the search for the shortest route, it is generally done based on the shortest distance traveled from one point to another. So in this study to determine the shortest route using Dijkstra's algorithm and Floyd Warshall's algorithm from one vertex to another on a weighted graph which gives the output in the form of the shortest path which can be taken to go to Parangtritis beach. Therefore, the system always provides a path with the most optimal travel time.}
}