Challenge: Implement Depth-First Search

Implement a depth-first search traversal in a directed graph using an adjacency list representation. Understand how to return the order of nodes visited from a specified source vertex, reinforcing key graph traversal techniques relevant for Go coding interviews.