Critical Connections
In a given graph, a critical connection is an edge that, when removed, increases the number of connected components in the graph. Given a graph with n nodes and edges, find all critical connections.
Constraints:
- 1 <= n <= 10^4
- 0 <= edges.length <= 10^4
- edges[i].length == 2
- 0 <= edges[i][0] < n
- 0 <= edges[i][1] < n
- edges[i][0] != edges[i][1]
Examples:
Input: [[0,1],[1,2],[2,0],[1,3]]
Output: [[1,3]]
Explanation: The edge between nodes 1 and 3 is a critical connection because removing it increases the number of connected components in the graph.
Solutions
Tarjan's Algorithm
Tarjan's algorithm is used to find all critical connections in the graph. The algorithm works by performing a depth-first search (DFS) on the graph and keeping track of the discovery time and low value for each node. The low value of a node is the smallest discovery time of any node that is reachable from the current node. If the low value of a node is greater than the discovery time of its parent, then the edge between the node and its parent is a critical connection.
vector<vector<int>> criticalConnections(int n, vector<vector<int>>& edges) {
vector<vector<int>> graph(n);
for (auto& edge : edges) {
graph[edge[0]].push_back(edge[1]);
graph[edge[1]].push_back(edge[0]);
}
vector<int> low(n, 0), disc(n, 0);
int time = 0;
vector<vector<int>> result;
function<void(int, int)> dfs = [&](int node, int parent) {
disc[node] = low[node] = time++;
for (int neighbor : graph[node]) {
if (disc[neighbor] == 0) {
dfs(neighbor, node);
low[node] = min(low[node], low[neighbor]);
if (low[neighbor] > disc[node]) {
result.push_back({
node, neighbor}
);
}
}
else if (neighbor != parent) {
low[node] = min(low[node], disc[neighbor]);
}
}
}
;
for (int i = 0;
i < n;
i++) {
if (disc[i] == 0) {
dfs(i, -1);
}
}
return result;
}Follow-up:
Find all critical connections in a directed graph.
