Challenge: Implement Depth-First Search

Implement depth-first search (DFS) on a directed graph starting from a given source vertex. This lesson helps you understand DFS traversal using adjacency lists, essential for solving graph problems in coding interviews.