Rudolf Adamkovič Personal site


Space and time complexity

The space and time complexity of BFS is

\[\mathcal{O}(b^{d + 1}),
\]
where\(b\)is the branching factor and
\(d\)is the depth of the shallowest solution.

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.