The memory used by BFS is exponential in the depth of the search.

If a = 10 and d = 100 (not unreasonable for some graphs), a full BFS would require a queue of size 10¹⁰⁰ (a googol).