Your question is Optimizing BFS at Scale. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
What is your approach to optimizing a Breadth-First Search (BFS) implementation for a large-scale graph?