LeetCode 1192. 查找集群内的「关键连接」Tarjan找桥

题意：给n个点构成的图，定义关键连接为去掉后图就变得不连通的边，求出所有这样的边
思路：tarjan找桥裸题（居然还是困难难度）。当某个点i的low值大于其父亲节点dfn值时，表示从i往上推无法推到其父亲，即路径中不存在环，故其与父亲之间的边一定不能删去，否则图就变得不连通，换言之这条边就是桥。用tarjan处理过后找出所有符合条件的边即可。
好久没碰Java，不知道是LeetCode的锅还是Java的锅，写这样的题真的很麻烦，LeetCode的参数中用的还是List，调了很长时间过后又因为Java太慢结果超时了，换了C++才过了，真的无语。。看来以后也要注意多刷几道LeetCode了

const int maxn = 1e5+5;
int n, dfn[maxn], low[maxn], vis[maxn], cnt, father[maxn];
vector<int> g[maxn];
class Solution {
public:
    void tarjan(int x, int fa)
    {
        dfn[x] = low[x] = ++cnt;
        father[x] = fa;
        for (int i = 0; i < g[x].size(); i++) {
            int v = g[x][i];
            if (!dfn[v]) {
                tarjan(v, x);
                low[x] = min(low[x], low[v]);
            }
            else if (v != fa){
                low[x] = min(low[x], dfn[v]);
            }
        }
    }
    vector<vector<int>> criticalConnections(int n, vector<vector<int>>& connections) {
        vector<vector<int>> ans;
        memset(dfn, 0, sizeof(dfn));
        memset(low, 0, sizeof(low));
        memset(father, 0, sizeof(father));
        cnt = 0;
        for (int i = 0; i < n; i++)
            g[i].clear();
        for (int i = 0; i < connections.size(); i++) {
            int x = connections[i][0], y = connections[i][1];
            g[x].push_back(y);
            g[y].push_back(x);
        }
        for (int i = 0; i < n; i++) {
			if (!dfn[i])
				tarjan(i, -1);
		}
		for (int i = 0; i < n; i++) {
			int v = father[i];
			if (v != -1 && low[i] > dfn[v]) {
                vector<int> temp;
                temp.push_back(i);
                temp.push_back(v);
				ans.push_back(temp);
            }
		}
        return ans;
    }
};