| Breadth-First Search (cont.) |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Time complexity: |
||||||||||
| – | Branching factor
b |
||||||||||
| – | Search depth d |
||||||||||
| – | O(b^d) |
||||||||||
| • | Space complexity
also O(b^d) |
||||||||||
| • | Same time/space
complexity. Which is |
||||||||||
| the more critical
limit? |
|||||||||||
