Minimum Number of Vertices to Reach All Nodes LeetCode solution in Python

1
class Solution:
2
    def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]:
3

4
        parent = [[] for i in range(n)]
5
        for i in edges:
6
            parent[i[1]].append(i[0])
7
        ans = []
8
        for i in range(n):
9
            if len(parent[i]) == 0:
10
                ans.append(i)
11
        return ans