// Creates an adjacency list to represent the graph. // Uses recursion to perform Depth First Search. // Marks visited vertices to prevent repeated traversal. // Visits each connected vertex ...