拓扑排序判断

def solve(____):
    from collections import defaultdict, deque
    n = int(____)
    graph = defaultdict(____)
    in_degree = [____] * n
    for e in edges.split(____):
        u, v = map(int, e.split(____))
        graph[u].append(____)
        in_degree[v] += ____
    queue = deque([i for i in range(____) if in_degree[i] == ____])
    count = ____
    while queue:
        node = queue.popleft()
        count += ____
        for neighbor in graph[node]:
            in_degree[neighbor] -= ____
            if in_degree[neighbor] == ____:
                queue.append(____)
    print(____)