Compare Greedy and Dijkstra Algorithm to Find the Shortest Path of Tourist Sites at Semarang
Daftar Isi:
- The purpose of this application is to find shortest path from one tourist site to another tourist sites at Semarang uses Java programming. To find shortest path, this application compares possibility distances. The most minimum distance at the moment will be stored and used to calculate the shortest path. The search methods can use Greedy algorithm and Dijktra algorithm to find the best solutions, uses Tree for Data Structure and GUI (Graphical User Interface). Greedy and Dijkstra algorithm have almost same method for search. Greedy algorithm only choose one distance with the most minimum distance until found destination. Dijkstra algorithm also choose one distance with the most minimum distance until found destination but the searching process is not over yet. Dijkstra algorithm calculating all possibility path from starting location to destination then choose the best solution by compared which ways had the most minimum distance. With that two algorithms, this application can guarantee the solutions would be more accurate. User just pick one solution that he desired. This application can also insert and update the original data of information which stored in file text.