Challenge: Implement Breadth-First Search

Implement breadth-first search traversal starting from a given vertex in a directed graph using adjacency lists. Understand BFS order and constraints to better prepare for coding interviews focused on graph algorithms.