SIMULASI PENCARIAN RUTE TERPENDEK MENGGUNAKAN ALGORITMA A*(A STAR) dan ALGORITMA DIJKSTRA BERBASIS JAVA 3D
| Main Author: | Nuriawansyah, Rubby |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2011
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/19150/ |
Daftar Isi:
- Simulation is a process of imitation from something that real the situation around. This final exam stimulated two algorithm which are A* algorithm and the Dijkstra Algorithm for searching the shortest route to the 3D scene. The shortest search simulation with the A* algorithm and dijkstra algorithm needed for us to more understand and to more comprehend also to comparing the working process from both algorithm. In this final exam the simulation makes in form of 3D to give the real/fact expression in the process of the shortest route search simulation using the A* algorithm and Dijkstra Algorithm. The Building simulating process of 3D scene are using one of the java basic engine named J Monkey Engine. With implementing 2 algorithm which are A* algorithm and djikstra algorithm. And for represent the simulation result added library apache-log 4j-1.2.15. Between the A* algorithm and djikstra algorithm, the A* algorithm are better in the process of searching the shortest route. Because the A* algorithm are not checking the whole node, so its needed less time comparing from the djikstra algorithm.