Challenge: Implement Breadth-First Search

Understand how to implement breadth-first search (BFS) on directed graphs represented by adjacency lists. This lesson helps you learn BFS traversal starting from a source vertex, enabling you to solve common graph problems in technical interviews.