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