def get_connected_component_vertices(g, s):
    """
    Returns the list of vertices in the connected component of s.
    Use a dfs and return all the visited vertices.
    
    :type g: adjacency list of an unweighted graph
    :param s: vertex
    :type s: int
    :return: list(int)
    """
    V = []  # List of visited vertices
    Q = []
    Q.append(s)  # Stack

    while not Q == []:
        v = Q.pop()

        if v not in V:
            V.append(v)

            for neighbor in g[v]:
                Q.append(neighbor)
    
    return V