LeetCode题解(1192)：查找集群内的“关键连接”(Python)

题目：原题链接（困难）

标签：深度优先搜索、Tarjan算法

解法	时间复杂度	空间复杂度	执行用时
Ans 1 (Python)	$O(N+E)$	$O(N+E)$	916ms (40.22%)
Ans 2 (Python)
Ans 3 (Python)

解法一：

import collections
from typing import List


class Solution:
    def criticalConnections(self, n: int, connections: List[List[int]]) -> List[List[int]]:
        graph = collections.defaultdict(set)
        for edge in connections:
            graph[edge[0]].add(edge[1])
            graph[edge[1]].add(edge[0])

        ans = []

        dfn = [-1] * n
        low = [-1] * n

        def dfs(last, now, depth):
            dfn[now] = depth
            low[now] = depth
            for nxt in graph[now]:
                if nxt == last:
                    continue
                if dfn[nxt] == -1:
                    dfs(now, nxt, depth + 1)
                    if dfn[now] < low[nxt]:
                        ans.append([now, nxt])
                low[now] = min(low[now], low[nxt])

        dfs(-1, 0, 1)

        return ans