Challenge: Implement Depth-First Search

The challenge involves implementing a Depth-First Search (DFS) algorithm on a directed graph represented by an adjacency list. The task is to return an array that reflects the order of traversal starting from a specified source vertex. The problem includes constraints on the graph's size and the values within it, providing a framework for coding the solution.