Challenge: Implement Breadth-First Search

The challenge involves implementing a breadth-first search (BFS) on a directed graph represented as an adjacency list. Given a starting vertex, the task is to return an array that reflects the order of traversal. The constraints specify the range of the graph's length and the values within the adjacency list, ensuring the solution adheres to these limits.