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

Full description

Bibliographic Details
Main Author: Alija, Amani Saleh
Format: Dissertation
Language:English
English
English
Published: 2015
Subjects:
T10.5-11.9 Communication of technical information
Online Access:http://eprints.uthm.edu.my/1291/
Abstract Abstract here

Similar Items

Similar Items