n
Complete?
No – can get stuck in loops, e.g.,
Iasi
Neamt
Iasi
Neamt
n
Time?
O(b
m
)
, but a good heuristic can give
dramatic improvement
n
Space?
O(b
m
)
-- keeps all nodes in
memory
n
Optimal?
No
