def find_connected_vertices_to(graph, vertice):
    """Given a graph and a vertice, find all other vertices that are connected to it"""

    visited = []  # if the visitation order to vertices isn't relevant, a set is better for performance purposes

    def dfs(node):
        """Actual DFS algorithm"""
        visited.append(node)
        for neighbor in graph[node]:
            if neighbor not in visited:
                dfs(neighbor)

    dfs(vertice)

    return visited