Challenge: Implement Depth-First Search

Statement

Given a directed graph represented by an adjacency array graph and an integer source, representing the start vertex of the graph, return an array of integers, result that ...