Challenge: Implement Depth-First Search

Explore how to implement depth-first search on directed graphs using adjacency arrays in Java. Understand traversal order from a given source vertex and apply this fundamental graph algorithm to solve coding interview challenges effectively.