|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Summer 2012 Finding Shortest Path in the Environment with Obstacles 
ABSTRACT This project implemented the shortest path searching in a graph developed by JAVA. The shortest path problem is to find a path with the lowest cost between two places in the roadmap. In the road network, the A* algorithm achieves better performance than Dijkstra's algorithm. The A* algorithm likes revised version of Dijkstra's algorithm. In most cases, the A* algorithm should run faster than Dijkstra's algorithm, with the help of heuristic estimate. This project built virtual graph to prove that A* is better than Dijkstra's in the shortest path finding between two nodes/vertices. The running time of the algorithm and the number of nodes in graph are the key outputs. And the program results proved that A* algorithm performs better. |
||||||
|
