Analysis of Dijkstra’s and A* algorithm to find the shortest path

• 第一著者: Alija, Amani Saleh
• フォーマット: 学位論文
• 言語: English; English; English
• 出版事項: 2015
• 主題: T10.5-11.9 Communication of technical information
• オンライン･アクセス: http://eprints.uthm.edu.my/1291/2/AMANI%20SALEH%20ALIJA%20COPYRIGHT%20DECLARATION.pdf; http://eprints.uthm.edu.my/1291/1/24p%20AMANI%20SALEH%20ALIJA.pdf; http://eprints.uthm.edu.my/1291/3/AMANI%20SALEH%20ALIJA%20WATERMARK.pdf; http://eprints.uthm.edu.my/1291/

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...