<doocs>1557.Minimum Number of Vertices to Reach All Nodes_1.py
def findSmallestSetOfVertices( n: int, edges: List[List[int]]) -> List[int]:
    s = {to for _, to in edges}
    return [i for i in range(n) if i not in s]
def sample_funcname ( var_0 : int , var_2 : List [ List [ int ] ] ) -> List [ int ] :
    var_6 = { var_4 for var_5 , var_4 in var_2 }
    return [ var_7 for var_7 in range ( var_0 ) if var_7 not in var_6 ]
