##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(LeetCode 1192)
The problem: There are servers numbered to connected by undirected edges. Find all critical connections (bridges). Input: , connections = . Output: . You need to find all edges whose removal disconnects the network.
This is exactly Tarjan's bridge algorithm. An edge is critical if there is no alternate path bypassing it. Use DFS to compute low-link values.
