A* Search
3243463542
S 0+9
A ∞+7
B ∞+7
C ∞+4
D ∞+6
E ∞+3
F ∞+3
G ∞+0
queue · FIFO
S 0+9
take from the front
Get from S to G. Each node shows two numbers: **g**, what it actually cost to reach it, and **h**, a straight-line *guess* of what's left. A* always expands the node with the smallest g + h — so it aims at the goal instead of spreading out blindly like Dijkstra.
step 01/19
- just discovered
- visited
- found it
- visiting now