### Implement Breadth-First Search on a graph using a queue-based adjacency list traversal.
Implement Breadth-First Search on a graph using a queue-based adjacency list traversal.