Challenge: Implement Breadth-First Search

Explore how to implement breadth-first search (BFS) on a directed graph represented by adjacency lists. This lesson guides you through returning the traversal order starting from a given source vertex, reinforcing core graph traversal techniques essential for coding interviews in C++.