Shortest Path Search Futsal Field Location With Dijkstra Algorithm
Citations Over TimeTop 10% of 2018 papers
Abstract
Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.
Related Papers
- → A New Shortest Path Algorithm based on Heuristic Strategy(2006)23 cited
- A Kind of Shortest Path Algorithm Based on Dijkstra(2012)
- → Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm(2018)2 cited
- An optimization algorithm of arbitrary shortest route between cities and its implementation(2007)
- Realization of the Shortest Path's Algorithm in Data Structure(2007)