PENERAPAN FORMULA HAVERSINE DAN ALGORITMA DJIKSTRA UNTUK MENCARI JARAK MASJID TERDEKAT

Siswanto, Agus 2023, Implementation of Haversine Formula and Dijkstra's Algorithm to Find the Distance to the Nearest Mosque. This title was formed from the author's anxiety when looking for a place of worship in a new location. There are already many places of worship, but obstructions such as being far from the worship, prayer reminders, and the call to prayer not heard because we are in a soundproof place such as an office or even we are in a place where the majority are non-Muslims and the existence of a prayer room or mosque which is quiet because the location is unknown so that it can prosper the mosque or prayer room, Therefore the author makes a solution to the problem of finding mosques and prayer rooms around us and so that ta'mir or can mark mosques or prayer rooms so that people who install the application can be known. the algorithm for finding the nearest mosque or prayer room is Haversine where the system will later calculate the user's device point from the nearest place of worship and when the user wants to know the route to the mosque or prayer room it will calculate the node from the device point to the nearest mosque or prayer room using the Dijkstra algorithm. The mosque and prayer room can prosper with the search for the nearest place of worship. The haversine algorithm itself is used to calculate two coordinate points and the Dijkstra to find routes from two points in a graph.

Keywords: Dijkstra algorithm, Haversine algorithm, religion , shortest path.