Algorithms

Question 1

Define the A* algorithm

Answer 1

A path finding algorithm that approximately finds the shortest path between two nodes by keeping track of the distance travelled from the source to the current node and the approximate distance from the next node the to the destination (heuristic function)

Question 2

Define Dijkstra’s Shortest Path Algorithm

Answer 2

An algorithm to find the shortest path between two nodes on a graph by using a priority queue to keep track of the shortest distance to each node from the starting node until the destination node is found