Intermediate
Data Structures & Algorithms
Q69 / 100
What problem does the A* algorithm solve?
Correct! Well done.
Incorrect.
The correct answer is B) Finding the shortest path from source to goal using a heuristic to guide search
B
Correct Answer
Finding the shortest path from source to goal using a heuristic to guide search
Explanation
A* uses f(n) = g(n) + h(n) where g is cost from start and h is an admissible heuristic estimate to goal. It finds optimal paths faster than Dijkstra in practice.
Progress
69/100