Evaluasi dan Usaha Optimalisasi Algoritma Depth First Search dan Breadth First Search dengan Penerapan pada Aplikasi Rat Race dan Web Peta
| Main Authors: | Kandaga, Tjatur, Hapendi, Alvin |
|---|---|
| Format: | Article PeerReviewed Book |
| Terbitan: |
, 2008
|
| Subjects: | |
| Online Access: |
http://repository.maranatha.edu/331/1/Evaluasi%20dan%20Usaha%20Optimalisasi%20Algoritma%20Depth%20First%20Search.pdf http://repository.maranatha.edu/331/ |
Daftar Isi:
- Rat Race is a maze game. There is a rat with a main task to search an exit in the maze. The rat is provide with two blind search algorithm, that is Depth First Search and Breadth First Search. The main goal is to find an exit with minimum steps. In this application, Depth First Search has fewer steps to reach an exit than Breadth First Search algorithm. That is because Breadth First Search algorithm had so many backward steps. The blind search algortihm also can be use in another application. Web Peta is an application that use Depth First Search algorithm. The main purpose of this application are to search a route from one place to another place in map. The application also must provide alternative route and the shortest route.