Analysis of Dijkstra’s and A* algorithm to find the shortest path
There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/7478/ http://eprints.uthm.edu.my/7478/1/AMANI_SALEH_ALIJA.pdf |