def dfs_visited_re(node, graph, visited=[]):
    """DFS: Return visited nodes via recursion"""
    for child in graph[node]:
        if child not in visited:
            visited.append(child)
        dfs_visited_re(child, graph, visited)
    return visited