Solution: Implement Breadth-First Search

The breadth-first search (BFS) algorithm is employed to traverse a directed graph represented as an adjacency list, starting from a specified source vertex. The method explores all immediate neighbors before moving to the next level, while managing cycles through a visited array to prevent revisiting vertices. The traversal continues until all vertices are explored, resulting in an ordered array of visited vertices. The time complexity is O(V + E), and the space complexity is O(V), where V is the number of vertices and E is the number of edges in the graph.