previous
|
index
|
next
Best-First Search Example
A
is removed and expanded, its children are placed on
PQ
in heuristic order, and the search tree is grown:
previous
|
index
|
next