Optimisation Algorithms

Question 1

Heuristic Definition (A* Algorithm)

Answer 1

A guess that estimates the distance from each node to the destination node

Question 2

Similarities Between Dijkstra’s Shortest Path and A*

Answer 2

• Both are path finding algorithms
• Both always find the shortest route between two nodes

Question 3

Differences Between Dijkstra’s Shortest Path and A*

Answer 3

• A* uses heuristics, Dijkstra does not
• A* is usually more efficient, Dijkstra is usually slower