Up: Breadth-first search (BFS) [Top][Contents]
The space and time complexity of BFS is
\[\mathcal{O}(b^{d + 1}), \]