Bridge in the graph is a edge that when removed increases the number of components in the graph

def articulation_points(graph: Graph):
    time = 0
    is_ap = [False for _ in range(graph.nodes)] # if node u is a articulation point
    disc = [0 for _ in range(graph.nodes)] # discovery time / discovery order to reach node u
    low = [0 for _ in range(graph.nodes)] # lowlink is the minimum node which can be reached from node u

    def dfs(u, p):
        nonlocal low, time, is_ap, disc
        time += 1
        low[u] = disc[u] = time
        for v in graph.adj[u]:
            if v == p:
                continue
            if disc[v] == 0:
                children += 1
                dfs(v, u)
                if disc[u] < low[v]:
                    is_ap[u] = True
                low[u] = min(low[u], low[v])
            else:
                low[u] = min(low[u], disc[v])

    for node in range(graph.nodes):
        if disc[node] == 0:
            dfs(node, node)
    
    print(is_ap)