test.py

def findSCC(g: list[list[int]]):
    n = len(g)
    on_stack = [False] * n
    stack = []
    t = [-1] * n
    low = [-1] * n
    c = 0
    scc = []

    def dfs(u):
        nonlocal c
        on_stack[u] = True
        stack.append(u)
        t[u] = c
        low[u] = c
        c += 1
        for v in g[u]:
            if t[v] == -1:
                dfs(v)
                low[u] = min(low[v], low[u])
            elif on_stack[v]:
                low[u] = min(low[u], t[v])
        if t[u] == low[u]:
            component = []
            while stack[-1] != u:
                node = stack.pop()
                on_stack[node] = False
                component.append(node)
            node = stack.pop()
            on_stack[node] = False
            component.append(node)
            scc.append(component)

    for source in range(n):
        if t[source] == -1:
            dfs(source)

    return scc