Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What makes A* faster than Dijkstra for point-to-point search, and when is it still optimal?
A
A heuristic h(n) guides search toward the goal; it stays optimal if h never overestimates the true remaining cost (admissible)
B
It ignores edge weights
C
It's always optimal with any heuristic
D
It explores all nodes in parallel