| Properties
of breadth-first search |
|
|
|
|
|
|
|
| n | Complete?
Yes (if b is finite) |
|||||
| n | Time? 1+b+b2+b3+… +bd
+ b(bd-1) = O(bd+1) |
|||||
| n | Space? O(bd+1) (keeps every node in
memory) |
|||||
| n | Optimal? Yes (if cost = 1 per step) |
|||||
| n | Space is the bigger problem (more than time) |
|||||
