Challenge: Implement Depth-First Search

Explore how to implement depth-first search on directed graphs represented by adjacency lists. Learn to traverse graph nodes starting from a source vertex and return the DFS order. This lesson helps you understand graph traversal algorithms and practice coding DFS in Python.