© 2000 Todd Neller.
A.I.M.A. t
ext
figures
© 1995 Prentice Hall.
Used by
permission.
Uniform-Cost Search
QUEUEING-FN
ß
HEAP-INSERT(node.cost)
Same as Breadth-First Search if cost
µ
depth
